Pagini recente » Cod sursa (job #975175) | Cod sursa (job #877454) | Cod sursa (job #2810065) | Cod sursa (job #1113584) | Cod sursa (job #1324490)
#include <fstream>
#include <limits.h>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int n,k,Max,s,i,v[16001],st,dr,mij,nr,Min,ok;
int main()
{
f>>n>>k;
Max=INT_MIN;
Min=-1;
s=0;
for(i=1;i<=n;i++)
{
f>>v[i];
if(Max<v[i])
Max=v[i];
s=s+v[i];
}
st=Max;
dr=s;
ok=0;
while(st<=dr)
{
mij=(st+dr)/2;
s=0;
nr=1;
for(i=1;i<=n&&nr<=k;i++)
{
s=s+v[i];
if(s>mij)
{
nr++;
s=v[i];
}
}
if(nr<=k)
{
Min=mij;
dr=mij-1;
}
else
{
st=mij+1;
}
}
g<<Min;
return 0;
}