Pagini recente » Cod sursa (job #733629) | Cod sursa (job #3257145) | Cod sursa (job #9673) | porc_revelion | Cod sursa (job #2222550)
#include <bits/stdc++.h>
#define Dim 16001
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
long N,K,Saltele[Dim],sum,maxim;
long drum,solutie,mij,st,dr;
int main()
{
f>>N>>K;
for(int i=1;i<=N;i++)
{
f>>Saltele[i];
maxim=max(maxim,Saltele[i]);
dr+=Saltele[i];
}
st=maxim;
while(st<dr)
{
drum=0,sum=0;
mij=(st+dr)/2;
for(int i=1;i<=N;i++)
{
sum+=Saltele[i];
if(sum+Saltele[i+1]>mij)
drum++,sum=0;
if(drum>K) break;
}
if(drum+1<=K) dr=mij;
else
if(drum+1>K) st=mij+1;
}
g<<st;
return 0;
}