Cod sursa(job #2182193)
| Utilizator | Data | 22 martie 2018 10:59:54 | |
|---|---|---|---|
| Problema | Transport | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.67 kb |
#include <fstream>
using namespace std;
const int L=27;
const int N=16000;
int n, v[N], k;
bool sepoate(int c){
int nr=0, cc=0;
for(int i=0; i<n; i++){
if(v[i]>cc){
nr++;
cc=c;
}
if(v[i]>cc){
return false;
}
if(nr>k){
return false;
}
cc-=v[i];
}
return true;
}
int main(){
ifstream in("transport.in");
ofstream out("transport.out");
in>>n>>k;
for(int i=0; i<n; i++){
in>>v[i];
}
int r=0, pas=1<<L;
while(pas!=0){
if(!sepoate(r+pas)){
r+=pas;
}
pas/=2;
}
out<<r+1;
return 0;
}
