Cod sursa(job #2535816)
| Utilizator | Data | 1 februarie 2020 11:38:44 | |
|---|---|---|---|
| Problema | Transport | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.83 kb |
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int v[16001];
int main()
{
int i,n,k,c,s,ans,vmax=0;
long long p=0;
int st,dr,med;
fin>>n>>k;
for (i=1; i<=n; i++)
{
fin>>v[i];
if(v[i]>vmax)
vmax=v[i];
p=p+v[i];
}
st=vmax;
dr=p;
while (st<=dr)
{
med=(st+dr)/2;
c=0;
s=0;
for (i=1; i<=n; i++)
{
s=s+v[i];
if(s+v[i+1]>med)
{
c++;
s=0;
}
}
c++;
if(c<=k)
{
dr=med-1;
ans=med;
}
else
st=med+1;
}
fout<<ans;
return 0;
}
