Pagini recente » Cod sursa (job #848749) | Istoria paginii runda/bruiaj2/clasament | Cod sursa (job #2746244) | Cod sursa (job #1524538) | Cod sursa (job #1586565)
#include <iostream>
#include <fstream>
using namespace std;
int n,k,a,b=0,c,x,y,z,v[16000],i,stt;
int main()
{
ifstream f("transport.in");
ofstream g("transport.out");
f>>n>>k;
for(i=1;i<=n;i++)
{f>>v[i];if(v[i]>a)a=v[i];}
stt=1;
do{
i=1;c=0;
while(z<=k and i<n)
{
while(i<n)
{
while(c<=a)
{
c=c+v[i];
i++;
}
z++;c=0;
}
a++;
}
if(i>=n and z<=k) stt=0;
}
while (stt==1);
g<<a;
return 0;
}