Cod sursa(job #1585584)
Utilizator | Draghici Razvan razvandraghici | Data | 31 ianuarie 2016 11:38:01 |
---|---|---|---|
Problema | Transport | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.66 kb |
#include <fstream>
using namespace std;
long long n, k, i, st, dr, mij, v[16003], s, nr, x, maxim;
int main()
{
ifstream fin("transport.in");
ofstream fout("transport.out");
fin>>n>>k;
for(i=1;i<=n;i++){
fin>>v[i];
if(maxim<v[i])
maxim=v[i];
}
st=maxim;
dr=256000000;
while(st<=dr){
nr=1;
mij=(st+dr)/2;
for(i=1;i<=n;i++){
s+=v[i];
if(s>mij){
nr++;
s=v[i];
}
}
if(nr>k)
st=mij+1;
else
dr=mij-1;
s=0;
}
fout<<st;
return 0;
}