Pagini recente » Cod sursa (job #715692) | Cod sursa (job #299534) | Cod sursa (job #386171) | Cod sursa (job #830278) | Cod sursa (job #2106777)
#include <iostream>
#include <fstream>
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 sol;
fin >> s >> k;
for( int i = 1 ; i <= s ; ++i ){
fin >> x;
saltea[i] = saltea[i-1] + x;
}
st = 1; dr = 2000000000;
while( dr - st > 1 ){
mid = st + ( dr - st ) / 2;
kk = mid;
trs = 1;
for( int i = 1 ; i <= s ; ++i ){
if( saltea[i] > kk ){
++trs;
kk = mid + saltea[i-1];
}
}
cout << trs << " ";
if( trs <= k ){
sol = mid;
dr = mid;
}
else st = mid;
}
fout << sol;
return 0;
}