Cod sursa(job #3172645)
Utilizator | Stefan Bogdan stefan1010 | Data | 20 noiembrie 2023 23:00:15 |
---|---|---|---|
Problema | Transport | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.8 kb |
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int v[16001],N,K,i,st,dr,mij,maxi,sol;
int main()
{
fin>>N>>K;
int s,nrdrum;
maxi=0;
s=0;
for(i=1;i<=N;i++)
{
fin>>v[i];
maxi=max(v[i],maxi);
s+=v[i];
}
st=maxi;
dr=s;sol=-1;
while(st<=dr)
{
mij=(st+dr)/2;
s=0;nrdrum=1;
for(i=1;i<=N;i++)
{
if(s+v[i]<=mij)
s+=v[i];
else
{
s=v[i];
nrdrum++;
}
}
if(nrdrum>K)
{
st=mij+1;
}
else
{
sol=mij;
dr=mij-1;
}
}
fout<<sol;
return 0;
}