Cod sursa(job #2795743)
Utilizator | Data | 6 noiembrie 2021 21:28:01 | |
---|---|---|---|
Problema | Transport | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.73 kb |
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int n, li, ls, m, s, sol, a[16010], i, Max, nr, k;
int main()
{
cin>>n>>k;
for(i=1; i<=n; i++)
{
cin>>a[i];
if(a[i]>Max) Max=a[i];
s+=a[i];
}
li=Max;
ls=s;
m=(li+ls)/2;
while(li<=ls)
{
s=0;
nr=0;
for(i=1; i<=n; i++)
{
s+=a[i];
if(s>m && i!=n) nr++, s=a[i];
else if(i==n) nr++;
}
if(s-m>0) nr++;
if(nr<=k)
{
sol=m;
ls=m-1;
}
else li=m+1;
m=(li+ls)/2;
}
cout<<sol;
return 0;
}