Cod sursa(job #1275497)
| Utilizator | Data | 25 noiembrie 2014 11:58:05 | |
|---|---|---|---|
| Problema | Transport | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int n, k, i, v[16010], p, u, m, s, nr;
int main(){
f>>n>>k;
for(i=1; i<=n; i++)
{
f>>v[i];
u+=v[i];
}
p=1;
while(p<=u)
{
m=(u-p)/2+p;
s=0;
nr=0;
for(i=1; i<=n; i++)
{
s+=v[i];
if(s>m)
{
s=v[i];
nr++;
}
}
nr++;
if(nr>k)
p=m+1;
else
u=m-1;
}
g<<p<<"\n";
return 0;
}
