Pagini recente » Cod sursa (job #1684713) | Cod sursa (job #2785394) | Cod sursa (job #1849244) | Cod sursa (job #1571565) | Cod sursa (job #2285753)
#include <fstream>
using namespace std;
ifstream fin ("transport.in");
ofstream fout ("transport.out");
int i, v[16010], n, k, st, dr, mij, r, s, ok, maxx;
bool verif(int x)
{
int i, s=0, nr=0;
for(i=1;i<=n;i++)
{
s+=v[i];
if(s>x)
{
i--;
nr++;
s=0;
}
else if(s==x)
{
nr++;
s=0;
}
}
if(s!=0)
nr++;
if(nr<=k)
return 1;
else return 0;
}
int main()
{
fin >> n >> k;
for(i=1;i<=n;i++)
{
fin >> v[i];
maxx=max(maxx, v[i]);
s+=v[i];
}
st=maxx;
dr=s;
while(st<=dr)
{
mij=(st+dr)/2;
ok=verif(mij);
if(ok)
{
r=mij;
dr=mij-1;
}
else st=mij+1;
}
fout << r;
return 0;
}