Pagini recente » Cod sursa (job #2582939) | Cod sursa (job #1903335) | Cod sursa (job #197513) | Cod sursa (job #2974675) | Cod sursa (job #383972)
Cod sursa(job #383972)
#include<fstream.h>
#include<math.h>
ifstream f("transport.in");
ofstream g("transport.out");
int v[16001],n,k,s,i,max,t,c,st,dr,gasit,m;
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
{f>>v[i];
s=s+v[i];
if(v[i]>max) max=v[i];}
st=max; dr=s; c=gasit=0; t=1;
while(st<=dr&&gasit==0)
{m=(st+dr)/2;t=1;c=0;g<<m<<'\n'<<t<<'\n';
for(i=1;i<=n;i++)
{if(v[i]+c<=m) c=c+v[i];
else {c=v[i];
t++;}
if(m==9) g<<c<<' '<<v[i]<<' '<<t<<'\n';}
if(t==k) gasit=1;
else if(t<k) dr=m-1;
else st=m+1;}
g<<m<<"\n"<<gasit;
f.close(); g.close();
return 0;
}