Cod sursa(job #1646604)
| Utilizator | Data | 10 martie 2016 16:52:30 | |
|---|---|---|---|
| Problema | Transport | Scor | 0 |
| 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[16005], s, nr, x, maxim, sum;
int main()
{
ifstream fin("fact.in");
ofstream fout("fact.out");
fin>>n>>k;
for(i=1;i<=n;i++){
fin>>v[i];
sum+=v[i];
if(v[i]>maxim)
maxim=v[i];
}
st=maxim;
dr=sum;
while(st<=dr){
nr=1, s=0;
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;
}
fout<<st;
return 0;
}
