Cod sursa(job #1755598)
Utilizator | Data | 10 septembrie 2016 17:23:58 | |
---|---|---|---|
Problema | Transport | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.81 kb |
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int n,k,mx,s,c1,c2,mij,sf,nr,i,v[16001];
int main()
{
f >> n >> k;
mx = -1;
for(i = 1; i <= n; ++i)
{
f >> v[i];
if(v[i] > mx)
mx = v[i];
s += v[i];
}
c1 = mx;
c2 = s;
while(c1 > c2)
{
mij = (c1 + c2) / 2;
nr = 1;
for(i = 1; i <= n; ++i)
{
sf += v[i];
if(sf > mij)
{
sf = v[i];
nr++;
}
}
if(sf <= mij)
{
if(nr > k)
c1 = mij + 1;
else
c2 = mij - 1;
sf = 0;
}
}
g << c1 << '\n';
return 0;
}