Pagini recente » Cod sursa (job #2897234) | Cod sursa (job #2505903) | Cod sursa (job #190124) | Cod sursa (job #1935465) | Cod sursa (job #1740236)
#include <cstdio>
#define MAXN 16000
using namespace std;
int v[MAXN];
inline int func(int n, int k, int dim){
int i, sum, dr;
for(i=sum=dr=0; i<n; i++)
if(sum+v[i]<=dim)
sum+=v[i];
else{
++dr;
sum=v[i];
}
if(sum>0)
++dr;
return (dr<=k);
}
int main()
{
FILE *fin, *fout;
int n, k, i, pas, rez, maxim;
fin=fopen("transport.in", "r");
fscanf(fin, "%d%d", &n, &k);
for(i=maxim=0; i<n; i++){
fscanf(fin, "%d", &v[i]);
if(maxim<v[i])
maxim=v[i];
}
fclose(fin);
for(rez=0, pas=(1<<28); pas; pas>>=1)
if(rez+pas<maxim || func(n, k, rez+pas)==0)
rez+=pas;
fout=fopen("transport.out", "w");
fprintf(fout, "%d\n", rez+1);
fclose(fout);
return 0;
}