Pagini recente » Cod sursa (job #2579074) | Cod sursa (job #2086115) | Cod sursa (job #963998) | Cod sursa (job #2519192) | Cod sursa (job #723444)
Cod sursa(job #723444)
#include<fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int k,n,i,li,ls,mij,p,a[16001];
int valid(int c)
{long long sum=0,i,nrt=0;
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(sum>0)
++nrt;
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=16000;
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;
}