Cod sursa(job #2783968)
Utilizator | Data | 15 octombrie 2021 13:48:11 | |
---|---|---|---|
Problema | Transport | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.85 kb |
#include <fstream>
using namespace std;
int v[16001];
int main()
{
ifstream cin ("transport.in");
ofstream cout ("transport.out");
int n, k, s, st, dr, mij, max, cnt, sum, sol;
cin>>n>>k;
s=0;
max=-1;
for (int i=0; i<n; i++)
{
cin>>v[i];
if(v[i]>max)
max=v[i];
s+=v[i];
}
st=max;
dr=s;
while (st<=dr)
{
mij=(st+dr)/2;
cnt=0;
sum=0;
for (int i=0; i<n && cnt<=k ; i++)
{
if (sum+v[i]>mij)
{
cnt++;
sum=0;
}
sum+=v[i];
}
cnt++;
if (cnt>k)
st=mij+1;
else
{
sol=mij;
dr=mij-1;
}
sum=0;
}
cout<<sol;
return 0;
}