Cod sursa(job #2353006)
| Utilizator | Data | 23 februarie 2019 19:56:14 | |
|---|---|---|---|
| Problema | Transport | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.76 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("transport.in");
ofstream out ("transport.out");
int v[16002];
int main()
{
int n,k,i,maxx=0,s=0,snou=0,st,dr,mijl,cnt=0;
in>>n>>k;
for(i=1; i<=n; i++)
{
in>>v[i];
if(v[i]>maxx) maxx=v[i];
s+=v[i];
}
st=maxx;
dr=s;
while(st<=dr)
{
mijl=(dr+st)/2;
for(i=1; i<=n; i++)
{
if(snou+v[i]<=mijl) snou+=v[i];
else
{
cnt++;
snou=0;
snou+=v[i];
}
}
cnt++;
if(cnt>k) st=mijl+1;
else dr=mijl-1;
snou=0;
cnt=0;
}
out<<mijl;
return 0;
}
