Cod sursa(job #3295507)
Utilizator | Data | 6 mai 2025 10:31:37 | |
---|---|---|---|
Problema | Transport | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.69 kb |
#include <iostream>
using namespace std;
int v[16001],n,k,i,mij,cnt,cmij,e,st,dr,s,maxi=-1,sol;
int main()
{
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>v[i];
if(v[i]>maxi) maxi=v[i];
s+=v[i];
}
st=maxi;
dr=s;
while(st<=dr)
{
mij=(st+dr)/2;
cnt=1;
cmij=mij;
for(i=1;i<=n;i++)
{
if(cmij-v[i]<0)
{
cnt++;
cmij=mij-v[i];
}
else cmij-=v[i];
}
if(cnt>k)
st=mij+1;
else
{
sol=mij;
dr=mij-1;
}
}
cout<<sol;
return 0;
}