Cod sursa(job #1993201)
| Utilizator | Data | 22 iunie 2017 15:49:45 | |
|---|---|---|---|
| Problema | Transport | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.84 kb |
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int n,k,i,v[16001],nrop,ma,r,s,in,sf,lma;
int main()
{
f>>n>>k;
in=1;
for(i=1;i<=n;i++)
{
f>>v[i];
if(v[i]>in)
{
in=v[i];
}
}
sf=16000*16000;
ma=(sf+i)/2;
while(in<=sf)
{
s=0;
nrop=1;
for(i=1;i<=n;i++)
{
s=s+v[i];
if(s>ma)
{
s=v[i];
nrop++;
}
if(nrop>k)
{
in=ma+1;
ma=(in+sf)/2;
break;
}
}
if(nrop<=k)
{
lma=ma;
sf=ma-1;
ma=(sf+in)/2;
}
}
g<<lma;
return 0;
}
