Pagini recente » Cod sursa (job #521239) | Cod sursa (job #935771) | Cod sursa (job #1121220) | Cod sursa (job #1900412) | Cod sursa (job #2054301)
#include <iostream>
#include <fstream>
using namespace std;
int v[16003];
int main()
{
ifstream cin ("transport.in");
ofstream cout ("transport.out");
int n,k,st=1,dr=2100000000,mij,pasi=1,nr=1,sum=0,sol=-1;
cin>>n>>k;
for(int i=1;i<=n;i++)
{
cin>>v[i];
}
while(st<=dr)
{
mij=(st+dr)/2;
pasi=1;
nr=1;
while(nr<=n)
{
sum+=v[nr];
if(sum>mij)
{
nr--;
pasi++;
sum=0;
}
nr++;
}
sum=0;
if(pasi>k)
st=mij+1;
else
{
sol=mij;
dr=mij-1;
}
}
cout<<sol;
return 0;
}