Cod sursa(job #1077602)
Utilizator | Data | 11 ianuarie 2014 15:04:21 | |
---|---|---|---|
Problema | Transport | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("transport.in");
ofstream fo("transport.out");
int v[16002],n,k,s1;
int main() {
fi>>n>>k;
int mx=0;
for (int i=1;i<=n;i++){
fi>>v[i];
s1=s1+v[i];
if (v[i]>mx)
mx=v[i];
}
while (mx<s1) {
int mid=(mx+s1)/2,s2=0,t=1;
for (int i=1;i<=n;i++)
if (s2+v[i]<=mid)
s2=s2+v[i];
else {
s2=v[i];
t++;
}
if (t>k)
mx=mid+1;
else s1=mid;
}
fo<<mx;
return 0;
}