Cod sursa(job #3160788)
Utilizator | Data | 25 octombrie 2023 08:41:56 | |
---|---|---|---|
Problema | Transport | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.81 kb |
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int v[16001];
int main()
{
int n,k,i,maxi=-1,st,dr;
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>v[i];
if(v[i]>maxi)
maxi=v[i];
}
st=maxi;
dr=256000000;
int sol=-1;
int mij;
int sum;
while(st<=dr)
{
mij=(st+dr)/2;
sum=1;
int sumc=0;
for(i=1;i<=n;i++)
{
if(sumc+v[i]<=mij)
sumc=sumc+v[i];
else
{
sumc=0;
sum++;
}
}
if(sum>k)
st=mij+1;
else
{
sol=mij;
dr=mij-1;
}
}
cout<<sol+1;
return 0;
}