Cod sursa(job #240355)
Utilizator | Data | 7 ianuarie 2009 13:53:17 | |
---|---|---|---|
Problema | Transport | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include<fstream.h>
int a[16000];
long max,i,n,k,c,ok,nr,s;
ifstream f("transport.in");
ofstream g("transport.out");
int main(){
f>>n>>k;
max=0;
for(i=1;i<=n;i++){
f>>a[i];
if(a[i]>c)
c=a[i];}
s=0;
ok=0;
while(ok==0){
for(i=1;i<=n;i++)
{s=s+a[i];
if(s>c){
s=a[i];nr++;}}
c++;
if(nr<=k)
ok=1;}
g<<c;
f.close();
g.close();
return 0;}