Pagini recente » Cod sursa (job #2472754) | Cod sursa (job #1981968) | Cod sursa (job #2805705) | Cod sursa (job #2141875) | Cod sursa (job #2286121)
#include <iostream>
#include <fstream>
using namespace std;
fstream fin("transport.in");
ofstream fout("transport.out");
int main()
{
int v[16009];
int n, s = 0, maxx = 0;
fin >> n;
for(int i = 1; i <= n; i++){
fin >> v[i];
s = s + v[i];
if( v[i] > maxx)
maxx = v[i];
}
int stg = maxx , drp = s, mij = 0, cmij = 0;
while ( stg < drp ){
mij = (stg + drp)/2;
cmij = mij;
for( int i = 1; i <= n; i++ ){
if ( v[i] <= cmij ){
cmij = cmij - v[i];
}else{
cmij = mij;
}
}
stg = cmij;
drp = mij;
}
fout << stg;
return 0;
}