Pagini recente » Cod sursa (job #353061) | Cod sursa (job #1765374) | Cod sursa (job #419813) | Cod sursa (job #2227413) | Cod sursa (job #1659359)
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n, m, V[16005], minim, sum;
bool Test (int x)
{
int act, ori, i;
act=0;
ori=1;
for (i=1; i<=n; i++)
{
if (act+V[i]>x)
{
act=V[i];
ori++;
if (ori>m)
return 0;
}
else
act+=V[i];
}
return 1;
}
int Cautare()
{
int mijl, st, dr, ok=0;
st=minim; dr=sum;
while (st<=dr)
{
mijl=(st+dr)>>1;
if (Test(mijl))
{
ok=mijl;
dr=mijl-1;
}
else
{
st=mijl+1;
}
}
return ok;
}
int main()
{
int i;
fin>>n>>m;
for (i=1; i<=n; i++)
{
fin>>V[i];
minim=max(V[i], minim);
sum+=V[i];
}
fout<<Cautare();
return 0;
}