Pagini recente » Cod sursa (job #805539) | Cod sursa (job #1145261) | Cod sursa (job #1652548) | Cod sursa (job #1744071) | Cod sursa (job #2355226)
#include <iostream>
#include <cstdio>
using namespace std;
int v[16002];
int main()
{
freopen ("transport.in","r",stdin);
freopen ("transport.out","w",stdout);
int n,k,i,maxx=0,s=0,snou=0,st,dr,mijl,cnt=0;
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>v[i];
if(v[i]>maxx) maxx=v[i];
}
st=maxx;
dr=s+10;
while(st<=dr)
{
mijl=(dr+st)/2;
for(i=1;i<=n;i++)
{
if(snou+v[i]<=mijl) snou+=v[i];
else
{
cnt++;
snou=0;
snou=snou+v[i];
}
}
}
return 0;
}