Cod sursa(job #2287996)
| Utilizator | Data | 22 noiembrie 2018 19:03:23 | |
|---|---|---|---|
| Problema | Transport | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.99 kb |
#include <fstream>
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
int v[16005];
int n;
int caut(int k)
{
int st=1,dr=1000000000,mij;
while(st<dr)
{
int nr=0,val=0;
mij=(st+dr)/2;
for(int i=1; i<=n; i++)
{
if(val+v[i]==mij)
{
val=0;
nr++;
}
else if(val+v[i]<mij)
{
val=val+v[i];
}
else
{
nr++;
val=v[i];
}
}
if(val>0)
nr++;
if(nr==k)
{
break;
}
else if(nr<k)
{
dr=mij-1;
}
else
{
st=mij+1;
}
}
return mij;
}
int main()
{
int k;
in>>n>>k;
for(int i=1; i<=n; i++)
{
in>>v[i];
}
out<<caut(k);
return 0;
}
