Pagini recente » Cod sursa (job #2525445) | Cod sursa (job #1287620) | Cod sursa (job #275253) | Cod sursa (job #662656) | Cod sursa (job #1646604)
#include <fstream>
using namespace std;
long long n, k, i, st, dr, mij, v[16005], s, nr, x, maxim, sum;
int main()
{
ifstream fin("fact.in");
ofstream fout("fact.out");
fin>>n>>k;
for(i=1;i<=n;i++){
fin>>v[i];
sum+=v[i];
if(v[i]>maxim)
maxim=v[i];
}
st=maxim;
dr=sum;
while(st<=dr){
nr=1, s=0;
mij=(st+dr)/2;
for(i=1;i<=n;i++){
s+=v[i];
if(s>mij){
nr++;
s=v[i];
}
}
if(nr>k)
st=mij+1;
else
dr=mij-1;
}
fout<<st;
return 0;
}