Pagini recente » Cod sursa (job #1526632) | Cod sursa (job #47743) | Cod sursa (job #280190) | preONI 2005 runda #1 - solutii | Cod sursa (job #2841880)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int v[16384],k,n;
bool check(int gm){
int nrt,s;
nrt=1;
s=0;
for(int i=1;i<=n;i++){
if(s+v[i]<=gm)
s+=v[i];
else{
s=v[i];
nrt++;
}
}
return (nrt<=k);
}
int main()
{
int st,dr,mij,sol;
f>>n>>k;
st=dr=16000;
for(int i=1;i<=n;i++){
f>>v[i];
st=min(st,v[i]);
}
while(st<=dr){
mij=(st+dr)/2;
if(check(mij)){
sol=mij;
dr=mij-1;
}
else
st=mij+1;
}
g<<sol<<'\n';
return 0;
}