Cod sursa(job #1436110)
Utilizator | Data | 15 mai 2015 08:49:10 | |
---|---|---|---|
Problema | Transport | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int kMom, mij, sMom, n, k, ls, ld, s, mx, v[16005], mij2;
int main()
{
f>>n>>k;
for (int i=1; i<=n; i++)
{
f>>v[i];
if (v[i]>mx) mx=v[i];
s+=v[i];
}
ls=mx;
ld=s;
while (ls<=ld)
{
mij=ls+(ld-ls)/2;
sMom=0;
kMom=1;
for (int i=1; i<=n; i++)
{
sMom+=v[i];
if (sMom>mij) { sMom=v[i]; kMom++;}
}
if (kMom<=k) ld=mij-1;
else ls=mij+1;
}
return 0;
}