Pagini recente » Cod sursa (job #375537) | Istoria paginii utilizator/candlese60b | Borderou de evaluare (job #1626878) | Borderou de evaluare (job #493028) | Cod sursa (job #2071251)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
const int N=16001,L=28;
int v[N],n,k;
bool pos(int c)
{
int nr=0,cc=0;
for(int i=1;i<=n;i++){
if(v[i]>cc){
nr++;
cc=c;
}
if(v[i]>cc)
return false;
cc-=v[i];
}
return (nr<=k);
}
int caut()
{
int r=0,pas=1<<L;
while(pas!=0){
if(!pos(r+pas))
r+=pas;
pas/=2;
}
return ++r;
}
int main()
{
f>>n>>k;
for(int i=1;i<=n;i++){
f>>v[i];
}
g<<caut();
return 0;
}