이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define ll long long
bool check(ll mid, vector<ll>& psum, int *x, ll money){
for(int i = mid; i < (int)psum.size(); i++){
ll val = x[i - mid/2 - 1];
val *= (mid - mid/2);
ll tot = val - (psum[i - mid/2] - psum[i - mid]);
tot += (psum[i] - psum[i - mid/2]) - (x[i-mid/2 - 1] * (mid/2));
if(tot <= money){
return true;
}
}
return false;
}
int besthub(int r, int l, int x[], long long b){
vector<ll> psum(r+1);
psum[0] = 0;
for(int i = 1; i <= r; i++){
psum[i] = psum[i-1] + x[i-1];
}
ll left = 0, right = r, mid;
while(left < right){
mid = (left + right + 1)/2;
if(check(mid, psum, x, b)){
left = mid;
}else{
right = mid-1;
}
}
return left;
}
// signed main(){
// ios_base::sync_with_stdio(0); cin.tie(0);
// vector<int> v;
// v.push_back(1); v.push_back(2); v.push_back(10); v.push_back(12); v.push_back(14);
// cout << besthub(5, 20, v, 6);
// }
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |