Pagini recente » Cod sursa (job #2348603) | Cod sursa (job #1965141) | Cod sursa (job #2478116) | Cod sursa (job #2571101) | Cod sursa (job #1022758)
#include <fstream>
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
short n, k, v[16001], i, mi;
int mx;
int cautbin(short v[], short n, int st, int dr, short k)
{
int m, s, t;
short i;
while(st<dr)
{
m=st+(dr-st)/2;
s=0;
t=1;
for(i=1; i<=n; i++)
{
if(s+v[i]<=m) s+=v[i];
else
{
t++;
s=v[i];
}
}
if(t>k) st=m+1;
else dr=m;
}
return st;
}
int main()
{
in>>n>>k;
mi=0;
for(i=1; i<=n; i++)
{
in>>v[i];
mx+=v[i];
if(mi<v[i]) mi=v[i];
}
out<<cautbin(v, n, mi, mx, k);
return 0;
}