Cod sursa(job #1405490)
Utilizator | Data | 29 martie 2015 12:10:40 | |
---|---|---|---|
Problema | Transport | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.67 kb |
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int n, i, v[16010], p, u, m, k;
int calculeaza(int x){
int nr=0, s=0, nrt=0;
for(i=1; i<=n; i++)
{
if(v[i]>x)
return k+1;
s+=v[i];
if(s>x)
nr=1, s=v[i], nrt++;
else
nr++;
}
if(s>0)
nrt++;
return nrt;
}
int main(){
f>>n>>k;
for(i=1; i<=n; i++)
f>>v[i];
p=1;
u=(1<<30);
while(p<=u)
{
m=(p+u)>>1;
if(calculeaza(m)<=k)
u=m-1;
else
p=m+1;
}
g<<p<<"\n";
return 0;
}