Cod sursa(job #707757)
Utilizator | onisim necula misino | Data | 5 martie 2012 23:06:33 |
---|---|---|---|
Problema | Transport | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include<fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int maxi,i,s,nr,n,k,c,a[16000];
int main()
{f>>n>>k;
for(i=1;i<=n;++i)
{f>>a[i];
if(a[i]>maxi)
maxi=a[i];
}
c=maxi;
while(1)
{nr=0;
i=1;
s=0;
while(i<=n)
{s=s+a[i];
++i;
if(s>c)
{++nr;
s=0;
--i;
}
}
if(s!=0)
++nr;
if(nr==k)
break;
++c;
}
g<<c<<'\n';
f.close();
g.close();
return 0;
}