Pagini recente » Atasamentele paginii Profil Danyel26 | Diferente pentru blog/combinatorics-shortlist intre reviziile 48 si 47 | Cod sursa (job #2621009) | Diferente pentru utilizator/sir_icemaster intre reviziile 2 si 1 | Cod sursa (job #2107081)
#include <fstream>
#include <iostream>
#include <bitset>
#include <cstring>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int main(){
int s, k, saltea[16002];
int st, dr , mid;
int x, trs, kk;
int mn = 0, sum = 0;
fin >> s >> k;
for( int i = 1 ; i <= s ; ++i ){
fin >> x;
if( x > mn ) mn = x;
saltea[i] = x;
sum += x;
}
st = mn; dr = sum;
while( st < dr ){
mid = st + ( dr - st ) / 2;
kk = 0;
trs = 1;
for( int i = 1 ; i <= s ; ++i ){
if( kk + saltea[i] <= mid ){
kk += saltea[i];
}else{
++trs;
kk = saltea[i];
}
}
//cout << trs << " ";
if( trs <= k ) dr = mid;
else st = mid + 1;
}
fout << dr;
return 0;
}