Pagini recente » Cod sursa (job #99567) | Cod sursa (job #2477970) | Cod sursa (job #81233) | Cod sursa (job #2283589) | Cod sursa (job #1037673)
#include<fstream>
using namespace std;
int v[16001],k,n;
int binara(int stg, int dr)
{
int m=(stg+dr)/2,s=0,i,k2=1;
for(i=1;i<=n;i++)
{while(s+v[i]<=m&&i<=n){s=s+v[i];i++;}
if(i<=n){k2++;s=v[i];}}
if(k2>k)return binara(m,dr);
else if(k2<k)return binara(stg,m);
else {while(k2==k)
{k2=1;m--;s=0;
for(i=1;i<=n;i++)
{while(s+v[i]<=m&&i<=n){s=s+v[i];i++;}
if(i<=n){k2++;s=v[i];}}
}
return m+1;}
}
int main()
{
ifstream fcin("transport.in");
ofstream fcout("transport.out");
int i;
fcin>>n>>k;
for(i=1;i<=n;i++)
{fcin>>v[i];v[0]=v[0]+v[i];}
fcout<<binara(1,v[0])<<'\n';
return 0;
}