Pagini recente » Cod sursa (job #2422358) | Cod sursa (job #3158355) | Cod sursa (job #1851616) | Cod sursa (job #1755711) | Cod sursa (job #3216120)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int main()
{
int i,v[16001],s=0,T,n;
fin>>n>>T;
int maxx=0;
for(i=1; i<=n; i++)
{
fin>>v[i];
s+=v[i];
if(v[i]>maxx)
maxx=v[i];
}
int st=maxx,dr=s,mijl,k;
s=0;
int t,kmin;
while(st<=dr)
{
t=0;s=0;mijl=(st+dr)/2;k=mijl;
for(i=1; i<=n; i++)
{
s+=v[i];
if(s>k)
{
t++;
s=v[i];
}
}
t++;
if(t>T) st=mijl+1;
else {dr=mijl-1;kmin=k;}
}
fout<<kmin;
return 0;
}