Pagini recente » Cod sursa (job #850233) | Cod sursa (job #793117) | Cod sursa (job #316499) | Cod sursa (job #48273) | Cod sursa (job #2924556)
#include <fstream>
#include <cmath>
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
int v[16001],v2[256000001];
int main()
{
int n,k,i,j,st=1,dr,s=0,maxx=-1,m,ctr,sum,drum=1,sol;
in>>n>>k;
for(i=1; i<=n; i++)
{
in>>v[i];
maxx=max(maxx,v[i]);
s+=v[i];
}
for(i=maxx,j=1; i<=s; i++,j++)
v2[j]=i;
dr=s-maxx+1;
while(st<=dr)
{
m=(st+dr)/2;
ctr=v2[m];
sum=0,drum=1;
for(i=1; i<=n; i++)
{
if(v[i]+sum>ctr)
{
drum++;
sum=v[i];
}
else
sum+=v[i];
}
if(drum>k)
st=m+1;
else
{
dr=m-1;
sol=ctr;
}
}
out<<sol;
return 0;
}