Cod sursa(job #2255929)
| Utilizator | Data | 7 octombrie 2018 18:40:00 | |
|---|---|---|---|
| Problema | Transport | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[16001];
int main()
{
int s,max,nrt,mijl,st,dr,i,n,k,rez;
ifstream in("transport.in");
ofstream out("transport.out");
in>>n>>k;
s=0;
max=0;
for(i=1;i<=n;i++)
{
in>>v[i];
s=s+v[i];
if(v[i]>max)max=v[i];
}
st=max;
dr=s;
while(st<=dr)
{
mijl=(st+dr)/2;
s=0;
nrt=1;
for(i=1;i<=n;i++)
if(s+v[i]<=mijl)s=s+v[i];
else{nrt++;
s=v[i];}
if(nrt>k)st=mijl+1;
else {rez=mijl;
dr=mijl-1;}
}
out<<rez;
return 0;
}
