Pagini recente » Cod sursa (job #1015977) | Cod sursa (job #2403267) | Cod sursa (job #881994) | Cod sursa (job #2545013) | Cod sursa (job #729307)
Cod sursa(job #729307)
#include<fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
long long k,n,i,li,ls,mij,p,a[16001];
int valid(int c)
{long long sum=0,i,nrt=1;
for(i=1;i<=n;i++)
if(sum+a[i]>c)
{if(a[i]>c)
return 0;
sum=a[i];
nrt++;
if(nrt>k)
return 0;}
else
sum=sum+a[i];
if(nrt<=k)
return 1;
else
return 0;}
void citire()
{int i;
f>>n>>k;
for(i=1;i<=n;i++)
f>>a[i];}
int main()
{citire();
li=1;
p=0;
ls=160000000;
while(li<=ls)
{mij=(li+ls)/2;
if(valid(mij))
{p=mij;
ls=mij-1;}
else
li=mij+1;}
g<<p<<'\n';
f.close();
g.close();
return 0;}