Mai intai trebuie sa te autentifici.
Cod sursa(job #3260299)
| Utilizator | Data | 1 decembrie 2024 14:54:23 | |
|---|---|---|---|
| Problema | Transport | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.79 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int v[16001], ts, n;
bool check(int k)
{
int t=0, cr=1;
for(int i=1; i<=n; i++)
{
t+=v[i];
if(t>k)
{
t=v[i];
cr++;
}
if(v[i]>k)
return 0;
}
if(cr>ts)
return 0;
return 1;
}
int main()
{
int mx=0;
fin >> n >> ts;
for(int i=1; i<=n; i++){
fin >> v[i];
mx+=v[i];
}
int st=1, dr=mx, mij, a;
while(st<=dr)
{
mij=(st+dr)/2;
bool x=check(mij);
if(!x)
st=mij+1;
else
{
dr=mij-1;
a=mij;
}
}
fout << a;
return 0;
}
