Pagini recente » Cod sursa (job #1467820) | Cod sursa (job #1987717) | Cod sursa (job #1037087) | Cod sursa (job #2868803) | Cod sursa (job #3174597)
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int v[16001];
int main()
{
int n,k,c,minn=99999,n2,i,s,sc;
cin>>n>>k;
for(n2=1;n2<=n;n2++)
{
cin>>v[n2];
v[n2]=v[n2]+v[n2-1];
}
for(n2=v[n];n2>=1;n2--)
{
i=1;
s=0;
c=1;
sc=0;
while(i<=n)
{
s=s+v[i]-v[i-1];
if(s>n2)
{
s=0;
c++;
sc=i;
}
i++;
}
if(c<=k)
{
minn=n2;
}
}
if(minn<99999)
{
cout<<minn;
}
else
{
cout<<0;
}
return 0;
}