Cod sursa(job #3369467)
| Utilizator | Data | 20 octombrie 2026 15:24:11 | |
|---|---|---|---|
| Problema | Transport | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.85 kb |
#include <fstream>
using namespace std;
ifstream cin ("transport.in");
ofstream cout ("transport.out");
int v[16005];
int main()
{
int n,k,nrt,i,st,dr,m,sol=1,maxi=0,sum=0,l;
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>v[i];
if(v[i]>maxi)
{
maxi=v[i];
}
sum+=v[i];
}
st=maxi;
dr=sum;
while(st<=dr)
{
m=(st+dr)/2;
nrt=1;
l=v[1];
for(i=2;i<=n;i++)
{
if(l+v[i]<=m)
{
l+=v[i];
}
else
{
nrt++;
l=v[i];
}
}
if(nrt>k)
{
st=m+1;
}
else
{
sol=m;
dr=m-1;
}
}
cout<<sol;
return 0;
}
