Pagini recente » Cod sursa (job #2666913) | Cod sursa (job #227174) | Cod sursa (job #2330699) | Cod sursa (job #527346) | Cod sursa (job #2665977)
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int s,c,sc,nrc,v[101],n,k,i,uc,j,cc;
int main()
{
cin>>n>>k;
for( i=1; i<=n; i++)
{
cin>>v[i];
s=s+v[i];
}
if(s%k!=0)
c=s/k +1;
else
c=s/k;
sc=0;
nrc=1;
j=1;
cc=0;
for( i=1; i<=k; i++)
{
while( sc+v[j] <=c)
{
sc=sc+v[j];
j++;
}
nrc++;
uc=sc;
sc=0;
if(k==i+1)
{while(j<=n)
{
cc=cc+v[j];
j++;
}
}
if(cc>c)
c=cc;
}
if(nrc==k)
cout<<c;
else
cout<<max(c,sc+uc);
}