Pagini recente » Istoria paginii utilizator/luckytoef | Cod sursa (job #2034758) | Cod sursa (job #124584) | Cod sursa (job #1784069) | Cod sursa (job #752768)
Cod sursa(job #752768)
#include<fstream>
#include<iostream>
using namespace std;
long ii,c,dif,t,cnt,nrt,nrtm,i,x;
int main()
{ int n,k,s[16000];
ifstream f("transport.in");
ofstream g("transport.out");
f>>n>>k;
cout<<nrt<<endl;
for(i=1;i<=n;i++)
{
f>>s[i];
nrtm=nrtm+s[i];
cout<<nrtm<<endl;
if(s[i]>nrt)
nrt=s[i];
}
while(nrt!=nrtm && nrt+1!=nrtm)
{
dif=nrtm-nrt+1;
t=nrt+dif/2;
cnt=0;
for(i=1;i<=n;i)
{
ii=0;
while(ii+s[i]<t)
{
ii=ii+s[i];
i++;
if(i==n+1)
ii=t+1;
}
cnt++;
}
if(cnt>k)
nrt=t;
else
nrtm=t;
}
g<<nrt;
return 0;
}