Pagini recente » Cod sursa (job #2048479) | Cod sursa (job #544594) | Cod sursa (job #125735) | Cod sursa (job #122138) | Cod sursa (job #2911260)
#include <fstream>
using namespace std;
ifstream fin ("transport.in");
ofstream fout ("transport.out");
int n,k,i,s,maxx,sum,ok,maxc,l,j,v[16001];
int main()
{
fin>>n>>k;
for (i=1; i<=n; i++)
{
fin>>v[i];
s=s+v[i];
if (v[i]>maxc)
maxc=v[i];
}
for (i=maxc; i<=s; i++)
{
sum=0;
maxx=0;
ok=1;
l=0;
for (j=1; j<=n; j++)
{
sum=sum+v[j];
if (sum>i)
{
sum=sum-v[j];
if (sum>maxx)
maxx=sum;
sum=0;
l++;
if (l>k)
{
ok=0;
break;
}
sum=v[j];
}
if (j==n)
{
l++;
if (l>k)
{
ok=0;
break;
}
if (sum>maxx)
maxx=sum;
}
}
if (ok==1)
{
fout<<maxx;
return 0;
}
}
return 0;
}