Cod sursa(job #2382801)
Utilizator | Data | 18 martie 2019 18:05:00 | |
---|---|---|---|
Problema | Transport | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 1.02 kb |
#include <fstream>
using namespace std;
int v[16005];
ifstream cin("transport.in");
ofstream cout("transport.out");
int main()
{
int n,k,a;
cin >> n >> k;
int st=1,dr=256000000,mij;
for(int i=0; i<n; i++)
{
cin >> a;
v[i]=a;
}
int ca=k,s=0,last;
while(st<=dr)
{
k=ca-1;
mij=st+(dr-st)/2;
s=0;
for(int i=0; i<n; i++)
{
s+=v[i];
if(k>0)
{
if(s>=mij)
{
k--;
s=v[i];
}
}
if(k==0)
{
if(i<n-1)
st=mij+1;
else
{
dr=mij-1;
last=mij;
}
}
}
if(k>0)
{
dr=mij-1;
last=mij;
}
if(k<0)
st=mij+1;
}
cout << last;
return 0;
}