oj.uz

답안 #834918

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
834918 2023-08-23T01:31:49 Z maomao90 3단 점프 (JOI19_jumps) C++17
0 / 100
 18 ms 2764 KB 
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 500005;

int n;
int a[MAXN];
int q;

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n;
    REP (i, 1, n + 1) {
        cin >> a[i];
    }
    cin >> q;
    REP (i, 1, q + 1) {
        int l, r; cin >> l >> r;
        vi stk;
        int ans = 0;
        RREP (j, r, l) {
            if (SZ(stk) >= 2) {
                // a[stk[0]] is maximum.
                // stk[x] - j <= stk[0] - stk[x]
                // 2 * stk[x] <= stk[0] + j
                int lo = 0, hi = SZ(stk) - 1;
                while (lo < hi) {
                    int mid = lo + hi >> 1;
                    if (2 * stk[mid] <= stk[0] + j) {
                        hi = mid;
                    } else {
                        lo = mid + 1;
                    }
                }
                if (2 * stk[hi] <= stk[0] + j) {
                    mxto(ans, a[j] + a[stk[0]] + a[stk[hi]]);
                }
            }
            while (!stk.empty() && a[stk.back()] < a[j]) {
                stk.pop_back();
            }
            stk.pb(j);
        }
        cout << ans << '\n';
    }
    return 0;
}

Compilation message

jumps.cpp: In function 'int main()':
jumps.cpp:64:34: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   64 |                     int mid = lo + hi >> 1;
      |                               ~~~^~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 18 ms 2764 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 54.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -