Pagini recente » Cod sursa (job #1200711) | Cod sursa (job #739559) | Cod sursa (job #2629074) | Cod sursa (job #97152) | Cod sursa (job #2675706)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int n, k;
int s, v[16001];
void citire()
{
f >> n >> k;
for(int i = 1; i <=n; ++ i)
{
f >> v[i];
s += v[i];
}
}
int verif(int x)
{
int t = 1;
int c = 0;
for(int i = 1; i <= n; ++ i)
{
if(v[i] > x)
return 0;
if(c + v[i] > x)
{
t ++;
c = v[i];
}
else
{
c += v[i];
}
if(t > k)
return 0;
}
return 1;
}
int cautBin(int st, int dr)
{
int mid;
int cap = 0;
while(st <= dr)
{
mid = (st + dr) / 2;
if(verif(mid) == 1)
{
// cap = mid;
dr = mid - 1;
}
else
{
st = mid + 1;
}
}
return dr + 1;
}
int main()
{
citire();
g << cautBin(1, s);
f.close();
g.close();
return 0;
}
//R: 8
/*
6 3
7 3 2 3 1 4
7 10 12 15 16 20
*/