Cod sursa(job #3295501)
Utilizator | Data | 6 mai 2025 10:15:43 | |
---|---|---|---|
Problema | Transport | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 1 kb |
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int main()
{
int n, k, i, v[16001], maxi, s, st, mijl, cnt, gasit, sol;
long long dr;
cin>>n>>k;
gasit=0;
cnt=0;
maxi=-1;
for(i=1;i<=n;i++)
{
cin>>v[i];
if(v[i]>maxi)
{
maxi=v[i];
}
}
st=maxi;
dr=1LL*maxi*n;
while(st<=dr&&gasit==0)
{
mijl=(st+dr)/2;
s=0;
for(i=1;i<=n;i++)
{
s=s+v[i];
if(s>=mijl)
{
cnt++;
s=v[i];
}
}
if(cnt<k)
{
dr=mijl-1;
mijl=(st+dr)/2;
}
if(cnt>k)
{
st=mijl+1;
mijl=(st+dr)/2;
}
if(cnt==k)
{
gasit=1;
sol=mijl;
}
}
if(gasit==1)
{
cout<<sol;
}
return 0;
}