Pagini recente » Cod sursa (job #105136) | Cod sursa (job #1301269) | Cod sursa (job #2776346) | Cod sursa (job #645069) | Cod sursa (job #1195436)
#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=a[i];}
}
if(cont<k) return 1;
if(cont==k) return 2;
if(cont>k) return 3;
}
void binara()
{
int aux,o,li=maxx,lf=sum;
/*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;}
}
g<<aux;*/
for(int i=li;i<=lf;i++)
{
o=solve(i);
if(o==2) {g<<i;return ;}
}
}
int main()
{
citire();
binara();
return 0;
}