Cod sursa(job #3244367)
| Utilizator | Data | 24 septembrie 2024 16:45:13 | |
|---|---|---|---|
| Problema | Transport | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <iostream>
using namespace std;
int n,k,v[16000];
int transport (int vol)
{
int s=0,t=0,i;
for (i=0;i<n;i++)
{
if (s+v[i]>=vol)
{
s=0;
t++;
}
s=s+v[i];
}
return t;
}
int main()
{
int i;
cin>>n>>k;
for (i=0;i<n;i++)
{
cin>>v[i];
}
int st=1,dr=16000*16000,m=(st+dr)/2,poz;
while (st<=dr)
{
m=m=(st+dr)/2;
if (transport(m)<=k)
{
poz=m;
dr=m-1;
}
else
st=m+1;
}
cout<<poz;
return 0;
}
