Pagini recente » Cod sursa (job #414512) | Cod sursa (job #2112967) | Cod sursa (job #697232) | Cod sursa (job #1195158)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int a[16005],n,k,sum,maxx;
void citire()
{
f>>n>>k;
for(int i=1;i<=n;i++)
{
f>>a[i];
sum+=a[i];maxx=max(maxx,a[i]);
}
}
int solve(int m)
{
int av=0,cont=1;
for(int i=1;i<=n;i++)
{
if(a[i]+av<=m)
{
av+=a[i];
}
else {cont ++;av=0;}
}
if(cont<k) return 1;
if(cont==k) return 2;
if(cont>k) return 3;
}
void binara(int li,int lf)
{
int aux,o;
while(li<lf)
{
aux=(li+lf)/2;
o=solve(aux);
if(o==2) {g<<aux;return ;}
if(o==1) {lf=aux;}
if(o==3) {li=aux+1;}
}
g<<aux;
}
int main()
{
citire();
binara(maxx,sum);
return 0;
}