Pagini recente » Cod sursa (job #1035250) | Cod sursa (job #1454217) | Cod sursa (job #968444) | Cod sursa (job #1540281) | Cod sursa (job #1405487)
#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++)
{
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;
}