Cod sursa(job #2752222)
Utilizator | Data | 17 mai 2021 09:07:40 | |
---|---|---|---|
Problema | Transport | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.74 kb |
#include <fstream>
using namespace std;
ifstream in ("transport.in");
ofstream out ("transport.out");
int v[16001];
int main()
{
int n,k,i,st,dr,mij,s=0,cnt=0,sol;
in>>n>>k;
for(i=1;i<=n;i++)
{
in>>v[i];
}
st=v[1];
dr=16000;
while(st<=dr)
{
mij=(st+dr)>>1;
for(i=1;i<=n;i++)
{
s=s+v[i];
if(s>mij)
{
cnt++;
s=v[i];
}
}
if(s<=mij)
cnt++;
if(cnt<=k)
{
sol=mij;
dr=mij-1;
}
else
{
st=mij+1;
}
cnt=0;
s=0;
}
out<<sol;
return 0;
}