Pagini recente » Cod sursa (job #1714603) | Cod sursa (job #2132291) | Cod sursa (job #2272452) | Cod sursa (job #1630352) | Cod sursa (job #2002518)
#include <fstream>
#include <iostream>
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
int v[16001];
int main()
{
int n,k,i;
in>>n>>k;
for(i=0; i<n; i++)
in>>v[i];
int li = 0,ls = 0;
for(i=0;i<n;i++)
{
if(v[i]>li) li = v[i];
ls += v[i];
}
int mid = 1,t,s;
do
{
mid = (li+ls) / 2;
s=0;
t=1;
for(i=0; i<n; i++)
{
if(v[i] > mid)
{
t = 0;
break;
}
s+=v[i];
if(s > mid)
{
t++;
s = 0;
i--;
}
}
if(t<=k && t > 0)
{
ls = mid - (t > 0 ? 0:1);
}
if(t > k || t == 0)
{
li = mid + 1;
}
}
while(li < ls);
out<<li;
return 0;
}