Cod sursa(job #3261575)
| Utilizator | Data | 6 decembrie 2024 20:08:14 | |
|---|---|---|---|
| Problema | Transport | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.76 kb |
#include <iostream>
using namespace std;
int main()
{
int n,k,v[16001],s=0,maxi=0,i,st,dr,mijl,scurenta=0,cate,rasp;
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>v[i];
s+=v[i];
if(v[i]>maxi)
maxi=v[i];
}
st=maxi;
dr=s;
while(st<=dr)
{
mijl=(st+dr)/2;
cate=1;
scurenta=0;
for(i=1;i<=n;i++)
{
if (scurenta+v[i]>mijl)
{
cate++;
scurenta= 0;
}
scurenta+=v[i];
}
if (cate<=k)
{
rasp=mijl;
dr=mijl-1;
}
else
{
st=mijl+1;
}
}
cout<<rasp;
return 0;
}
