Pagini recente » Cod sursa (job #819192) | Cod sursa (job #3228436) | Cod sursa (job #1313080) | Rating Alexandru Lapusneanul (boier) | Cod sursa (job #2088487)
#include <iostream>
#include<cstdio>
using namespace std;
const int L=27;
int v[16001];
int n, k, c, i;
bool sepoate(int c)
{
int cc=c, nr=1;
for(int i=0; i<n; i++)
{
if(v[i]>c)
return false;
if(v[i]>cc)
{
nr++;
cc=c;
}
cc-=v[i];
if(nr>k)
return false;
}
return true;
}
int main()
{
FILE *fin, *fout;
int pas, r;
fin=fopen("transport.in", "r");
fout=fopen("transport.out", "w");
fscanf(fin, "%d %d\n", &n, &k);
for(i=0; i<n; i++)
fscanf(fin, "%d\n", &v[i]);
r=0;
pas=1<<L;
while(pas>0)
{
if(!sepoate(r+pas))
r+=pas;
pas/=2;
}
fprintf(fout, "%d", r+1);
fclose(fin);
fclose(fout);
return 0;
}