Cod sursa(job #2606415)
Utilizator | Data | 27 aprilie 2020 18:24:58 | |
---|---|---|---|
Problema | Transport | Scor | 80 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.78 kb |
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int v[500001];
int main()
{
int n,k,i,st,mij,nr=0,c,s;
long long dr;
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>v[i];
}
st=1;
dr=500000000000;
while(st<=dr)
{
mij=(st+dr)/2;
s=0;
c=0;
for(i=1;i<=n;i++)
{
s+=v[i];
if(s>mij)
{
s=v[i];
c++;
}
}
if(s!=0)
{
c++;
}
if(c>k)
{
st=mij+1;
}
else
{
nr=mij;
dr=mij-1;
}
}
cout<<nr;
return 0;
}