Pagini recente » Cod sursa (job #1013282) | Cod sursa (job #1706081) | Cod sursa (job #2302420) | Cod sursa (job #1574070) | Cod sursa (job #2988803)
#include <fstream>
#include <climits>
using namespace std;
ifstream in ("transport.in");
ofstream out ("transport.out");
long long s,v[16001],n,k,m;
bool verif(long long x)
{
long long last=0;
int j=k;
for(int i=1;i<=n;i++)
{
if(v[i]-last>x)
{
last=v[i-1];
i--;
j--;
}
if(j==0)
return 0;
}
return 1;
}
int main()
{
int x;
long long minim=INT_MIN;
in>>n>>k;
for(int i=1;i<=n;i++)
{
in>>x;
v[i]=x+v[i-1];
}
int st=1,dr=160000;
while(st<=dr)
{
m=(st+dr)/2;
if(verif(m)!=true)
st=m+1;
else
{
minim=m;
dr=m-1;
}
}
out<<minim;
return 0;
}