Pagini recente » Cod sursa (job #2276185) | Cod sursa (job #115296) | Cod sursa (job #3001044) | Cod sursa (job #2401870) | Cod sursa (job #3161454)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int v[1000];
int main()
{
int n,k,i=1,s=0,maxi;
fin>>n>>k;///n=nr saltele;k=nr drumuri
for(i=1;i<=n;i++)
{
fin>>v[i];
s=s+v[i];
}
i=1;
while(k>0)
{
int s2=0,x=s/k;
if(s%k>0)
{
x++;
}
if(x>maxi)
{
maxi=x;
}
while(s2<x)
{
s2+=v[i];
i++;
}
if(s2>x)
{
i--;
s2=s2-v[i];
}
s=s-s2;
k--;
}
fout << maxi << endl;
return 0;
}