Cod sursa(job #2920066)
| Utilizator | Data | 21 august 2022 19:53:24 | |
|---|---|---|---|
| Problema | Transport | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.71 kb |
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int n,i,m,st,dr,s,v[16001],sol,k,nr;
bool drive(int loc)
{
nr=1;
s=0;
for(i=1;i<=n;i++)
{
if(v[i]>loc)return 0;
if(s+v[i]>loc)
{
nr++;
s=v[i];
}
else s+=v[i];
}
if(nr>k)return 0;
return 1;
}
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
{
f>>v[i];
s+=v[i];
}
st=1;
dr=s;
while(st<=dr)
{
m=(st+dr)/2;
if(drive(m)==1)
{
sol=m;
dr=m-1;
}
else st=m+1;
}
g<<sol;
return 0;
}
