Pagini recente » Cod sursa (job #1456136) | Cod sursa (job #2906303) | Cod sursa (job #3186567) | Cod sursa (job #482082) | Cod sursa (job #1502999)
#include<stdio.h>
using namespace std;
int n,k,sol;
int v[16001];
bool ok(int Camion)
{
int cnt, i, s;
s = 1000000001; cnt=0;
for (i=1; i<=n; i++)
{
if (v[i] > Camion) return 0;
if (s+v[i] <= Camion)
{
s += v[i];
}
else
{
cnt++;
s = v[i];
}
}
if (cnt > k) return 0;
return 1;
}
int main()
{
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
scanf("%d %d",&n,&k);
for(int i=0; i<n; i++) scanf("%d",&v[i]);
int pas=1<<16,start=0;
for(pas; pas>0; pas=pas>>1)
{
if(!ok(start+pas)) start+=pas;
else sol=start+pas;
}
printf("%d",sol);
}