Pagini recente » Cod sursa (job #2283990) | Cod sursa (job #2714302) | Cod sursa (job #2990891) | Cod sursa (job #1404440) | Cod sursa (job #2340864)
#include <cstdio>
using namespace std;
const int NMAX = 1605;
int v[NMAX];
int n,k;
bool ok(int C)
{
int tr,i,sc;
tr = sc = 0;
for(i = 1;i <= n;i++)
{
if(v[i] > C)
return 0;
if(sc + v[i] <= C)
sc = sc + v[i];
else
{
tr++;
sc = v[i];
}
}
if(sc > 0)
tr++;
return tr <= k;
}
int bs_left(int st,int dr)
{
int med,last = -1;
while(st <= dr)
{
med = st + (dr - st) / 2;
if(ok(med))
{
last = med;
dr = med - 1;
}
else
st = med + 1;
}
return last;
}
int main()
{
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
int i,ans,smax = 0;
scanf("%d%d",&n,&k);
for(i = 1;i <= n;i++)
{
scanf("%d",&v[i]);
smax = smax + v[i];
}
ans = bs_left(1,smax);
printf("%d",ans);
return 0;
}