Pagini recente » Cod sursa (job #269436) | Cod sursa (job #1193445) | Cod sursa (job #1736359) | Cod sursa (job #2293025) | Cod sursa (job #1864897)
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int v[16002];
int main()
{
int n,k,halp;
int st=0,dr=0,sol;
fin>>n>>k;
for(int i=1;i<=n;i++)
{
fin>>halp;
if(halp>st) st=halp;
dr+=halp;
v[i]=halp+v[i-1];
}
fout<<st<<' '<<dr<<' ';
while(st<=dr)
{
int mid=(st+dr)/2,nr=1,curent=0;
for(int i=1;i<=n;i++)
{
if(mid-v[i]+curent<0)
{
nr++;
curent=v[i-1];
}
}
if(nr<=k)
{
dr=mid-1;
sol=mid;
}
else
st=mid+1;
}
fout<<sol;
return 0;
}