Pagini recente » Cod sursa (job #3218239) | Cod sursa (job #2176285) | Cod sursa (job #1845584) | Cod sursa (job #1895554) | Cod sursa (job #1009102)
#include<cstdio>
using namespace std;
int s,n,k,k_fals,i,check;
bool bn=0;
int v[16000];
void verif()
{
s=0;k_fals=1;
for (i=0;i<n && k_fals<=k;++i)
{
if (s+v[i]>check)
{
++k_fals;
s=0;
}
s=s+v[i];
}
if (i==n && k_fals==k)
bn=1;
}
int main()
{
FILE *fin=fopen("transport.in","r"),*fout=fopen("transport.out","w");
fscanf(fin,"%d%d",&n,&k);
s=0;
for (i=0;i<n;++i)
{
fscanf(fin,"%d",&v[i]);
s+=v[i];
}
if (s%k==0)
check=s/k-1;
else
check=s/k;
while (!bn)
{
++check;
verif();
}
fprintf(fout,"%d\n",check);
fclose(fin);
fclose(fout);
return 0;
}