Pagini recente » Cod sursa (job #461165) | Cod sursa (job #1722602) | Cod sursa (job #1658558) | Cod sursa (job #2158653) | Cod sursa (job #2242784)
//#include <fstream>
#include<iostream>
using namespace std;
int a, b, c, d, v[16001], k=0, m, lm;
int z(int lm, int m)
{
int n=1;
while(n<m)
{
a=(n+m)/2;
int nr = 0;
int cap = 0;
for(int i=0;i < lm;i++)
{
if(cap + v[i] > a)
{
nr++;
cap = v[i];
}
else
cap = cap + v[i];
}
if(nr<=d)
m=a-1;
else
n=a+1;
k=0;
}
return n+2;
}
int main()
{
ifstream cin ("transport.in");
ofstream cout ("transport.out");
int s=0;
cin>>m>>d;
for(int i=0;i<m;i++)
{
cin>>v[i];
s+=v[i];
}
b=z(m, s);
cout<<b;
return 0;
}