Cod sursa(job #3005343)
| Utilizator | Data | 16 martie 2023 21:41:06 | |
|---|---|---|---|
| Problema | Transport | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int main(){
int n, k, v[1600];
fin >> n >> k;
for(int i=1; i<=n; i++)
fin >> v[i];
for(int p=1; p<=n; p++){
int mx=0, s=0, tr=1;
for(int e=1; e<=p; e++)
mx+=v[e];
for(int i=1; i<=n; i++){
if(s+v[i]<=mx)
s+=v[i];
else if(s+v[i]>mx){
s=v[i];
tr++;
}
}
if(tr<=k){
fout << mx;
break;
}
}
}
