Pagini recente » Cod sursa (job #2785083) | Cod sursa (job #1674776) | Cod sursa (job #2195836) | Cod sursa (job #574164) | Cod sursa (job #3245952)
#include <fstream>
using namespace std;
ifstream cin ("transport.in");
ofstream cout ("transport.out");
int n,k,v[16000],max1=1;
int transport (int vol)
{
int s=0,i=0,t=0;
for (i=0;i<n;i++)
{
if (s+v[i]>vol)
{
s=0;
t++;
}
if (s+v[i]==vol)
{
s=0;
t++;
i++;
if (i==n)
break;
}
s=s+v[i];
}
if (s>0)
t++;
return t;
}
int main()
{
int i;
cin>>n>>k;
for (i=0; i<n; i++)
{
cin>>v[i];
if (max1<v[i])
max1=v[i];
}
int st=max1,dr=16000*16000,m=(st+dr)/2,poz;
while (st<=dr)
{
m=(st+dr)/2;
if (transport(m)<=k)
{
poz=m;
dr=m-1;
}
else
st=m+1;
}
cout<<poz;
return 0;
}