Pagini recente » Borderou de evaluare (job #1036778) | Cod sursa (job #1501494) | Cod sursa (job #1650783) | Cod sursa (job #785933) | Cod sursa (job #2333096)
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
const int NMAX=16005;
int v[NMAX], k, n;
bool ok(int C)
{
int tr, sc=0, i;
for(i=1;i<=n;i++)
{
if(v[i]>C)
return 0;
if(sc+v[i]<=C)
sc=sc+v[i];
else
{
tr++;
sc=v[i];
}
}
if(sc>0)
tr++;
return tr;
}
int bs(int st, int dr)
{
int med, last=-1;
while(st<=dr)
{
med=(st+dr)/2;
if(ok(med))
{
last=med;
dr=med-1;
}
else
st=med+1;
}
return last;
}
int main()
{
int i, s, ans;
for(i=1;i<=n;i++)
{
fin>>v[i];
s=s+v[i];
}
ans=bs(1, s);
fout<<ans<<"\n";
fin.close();
fout.close();
return 0;
}