Pagini recente » Cod sursa (job #2762915) | Cod sursa (job #2266651) | Cod sursa (job #765435) | Cod sursa (job #2886686) | Cod sursa (job #2552333)
#include <iostream>
#include <fstream>
using namespace std;
int v[16005],x,i,st,dr,m,k,o,n,mx,s,sol;
ifstream in("transport.in");
ofstream out("transport.out");
bool verif(int m, int v[])
{
x=m;o=1;
for (i=1;i<=n;i++)
{
if (v[i]>x) {o++;x=m;}
x-=v[i];
if (o>k) return 0;
}
if (o>k) return 0;
else return m;
}
int main()
{
in>>n>>k;
for (i=1;i<=n;i++)
{
in>>v[i];
if (v[i]>mx) mx=v[i];
s+=v[i];
}
st=mx;dr=s;
while (st<=dr)
{
m=(st+dr)/2;
int y=verif(m,v);
if (y) {sol=m;dr=m-1;}
else st=m+1;
}
out<<sol;
}