Cod sursa(job #2651522)
Utilizator | Data | 22 septembrie 2020 20:21:26 | |
---|---|---|---|
Problema | Transport | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.79 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,m,j,i,mid,st,dr,cmax,nr,sol,k,s,sm;
int v[16004];
int main()
{
fin>>n>>k;sm=0;cmax=0;
for(i=1;i<=n;i++)
{
fin>>v[i];
if(v[i]>cmax)
cmax=v[i];
sm=sm+v[i];
}
st=cmax;dr=sm;
while(st<=dr)
{
mid=(st+dr)/2;
s=v[1];nr=1;
for(j=2;j<=n;j++)
if(s+v[j]<=mid)
s=s+v[j];
else
{
s=v[j];
nr++;
}
if(nr<=k)
{
sol=mid;
dr=mid-1;
}
else
st=mid+1;
}
fout<<sol;
return 0;
}