Pagini recente » Cod sursa (job #148293) | Cod sursa (job #1367978) | Cod sursa (job #2337127) | Cod sursa (job #1743122) | Cod sursa (job #1113219)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("transport.in");
ofstream g("transport.out");
int n,k,v[100],m=0,ok=1,c,i,j;
f>>n>>k;
for(i=1;i<=n;i++)
{
f>>v[i];
if(v[i]>m)m=v[i];
}
v[n+1]=-1;
i=1;
while(ok==1)
{
j=1;
for(i=1;i<=k;i++)
{
c=m;
while(c>=0)
{
if(v[j]==-1)ok=0;
else
if(j>n)c=0;
else
if(c-v[j]>=0)
j++;
c=c-v[j-1];
}
}
if(ok==0)
g<<m;
else m++;
}
return 0;
}