Cod sursa(job #3171634)
Utilizator | Luca Munteanu LucaWaluca | Data | 19 noiembrie 2023 11:31:49 |
---|---|---|---|
Problema | Transport | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.79 kb |
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int v[16005];
int main()
{
int n,k,i;
int s=0,maxi=-1;
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>v[i];
if(v[i]>maxi)
maxi=v[i];
s+=v[i];
}
int st=maxi,dr=s,mij,aux;
while(st<=dr)
{
mij=(st+dr)/2;
int cnt=0;
s=0;
for(i=1;i<=n;i++)
{
s+=v[i];
if(s>mij)
{
cnt++;
s=v[i];
}
}
if(s!=0)
cnt++;
if(cnt<=k)
{
aux=mij;
dr=mij-1;
}
else
st=mij+1;
}
cout<<aux;
return 0;
}