Cod sursa(job #2069117)
Utilizator | Data | 18 noiembrie 2017 12:02:24 | |
---|---|---|---|
Problema | Transport | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 1.17 kb |
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int n,k,kk,st,sf,s,i,mid,v[16000],ma,mid1;
int main()
{
f>>n>>k;
ma=0;
for(i=1; i<=n; i++)
{
f>>v[i];
s=s+v[i];
if(v[i]>ma)ma=v[i];
}
st=ma;
sf=s;
while(st<=sf)
{
mid=(st+sf)/2;
s=0;
kk=1;
for(i=1; i<=n; i++)
{
if(v[i]+s<=mid)s=s+v[i];
else
{
s=v[i];
kk++;
}
}
if(kk>k)
{
st=mid+1;
}
if(kk<k)
{
sf=mid-1;
}
if(kk==k)
{
mid1=mid;
while(kk==k)
{
s=0;
kk=1;
mid1--;
for(i=1; i<=n; i++)
{
if(v[i]+s<=mid1)s=s+v[i];
else
{
s=v[i];
kk++;
}
}
}
g<<mid1+1;
break;
}
}
return 0;
}