Cod sursa(job #1463242)
Utilizator | Nicola Alexandra Mihaela Nicolaalexandra | Data | 20 iulie 2015 16:51:27 |
---|---|---|---|
Problema | Transport | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.71 kb |
#include <fstream>
using namespace std;
int n,k,i,x,vs,v[16003],maxim,c,j,aux;
ifstream fin ("transport.in");
ofstream fout ("transport.out");
int main (){
fin>>n>>k;
maxim = 0;
for (i=1;i<=n;i++){
fin>>v[i];
if (v[i]>maxim)
maxim = v[i];
}
for (i=maxim;;i++){
x = 0;
c = i;
vs = 1;
while (vs <= n){
if (c-v[vs] >= 0){
c-=v[vs++];
}
else{
x++;
c = i;
//vs++;
}
}
x++;
if (x <= k){
fout<<i<<"\n";
break;
}
}
return 0;
}