Pagini recente » Cod sursa (job #2666550) | Borderou de evaluare (job #1708046) | Cod sursa (job #1416989) | Cod sursa (job #512523) | Cod sursa (job #3160827)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int V[16001];
int main()
{
int n,k,maxi=0,st,dt,mij,c=0,i,cm,a;
int s=0;
fin>>n>>k;
for(int i=1;i<=n;i++)
{
fin>>V[i];
if(V[i]>maxi)
maxi=V[i];
s=s+V[i];
}
st=maxi;
dt=s;
while(st<=dt)
{
c=1;
mij=(st+dt)/2;
i=0;
cm=0;
for(int i=1;i<=n;i++)
{
if(cm+V[i]<=mij)
{
cm=cm+V[i];
}
else
{
cm=V[i];
c++;
}
}
if(c>k)
{
st=mij+1;
}
else
{
a=mij;
dt=mij-1;
}
}
fout<<a;
return 0;
}