oj.uz

답안 #872989

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
872989 2023-11-14T08:43:17 Z NeroZein 3단 점프 (JOI19_jumps) C++17
27 / 100
 141 ms 26192 KB 
#include "bits/stdc++.h"
using namespace std;

#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif

const int N = 5e5 + 5;

struct node {
  int ans;
  int ab, c;
};

node seg[N * 2]; 

node merge(const node& lx, const node& rx) {
  node ret;
  ret.ans = max({lx.ans, rx.ans, lx.ab + rx.c}); 
  ret.ab = max(lx.ab, rx.ab);
  ret.c = max(lx.c, rx.c); 
  return ret;
}

void build(int nd, int l, int r, const vector<int>& c) {
  if (l == r) {
    seg[nd].c = c[l];
    return;
  }
  int mid = (l + r) >> 1;
  int rs = nd + ((mid - l + 1) << 1);
  build(nd + 1, l, mid, c);
  build(rs, mid + 1, r, c);
  seg[nd].c = max(seg[nd + 1].c, seg[rs].c); 
}

void upd(int nd, int l, int r, int p, int v) {
  if (l == r) {
    seg[nd].ab = max(seg[nd].ab, v);
    seg[nd].ans = max(seg[nd].ans, seg[nd].ab + seg[nd].c); 
    return; 
  }
  int mid = (l + r) >> 1;
  int rs = nd + ((mid - l + 1) << 1);
  if (p <= mid) {
    upd(nd + 1, l, mid, p, v);
  } else {
    upd(rs, mid + 1, r, p, v); 
  }
  seg[nd] = merge(seg[nd + 1], seg[rs]); 
}

node qry(int nd, int l, int r, int s, int e) {
  if (l >= s && r <= e) {
    return seg[nd]; 
  }
  int mid = (l + r) >> 1;
  int rs = nd + ((mid - l + 1) << 1);
  node ret;
  if (mid >= e) {
    ret = qry(nd + 1, l, mid, s, e);
  } else {
    if (mid < s) {
      ret = qry(rs, mid + 1, r, s, e); 
    } else {
      ret = merge(qry(nd + 1, l, mid, s, e), qry(rs, mid + 1, r, s, e)); 
    }
  }
  return ret; 
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n;
  cin >> n;
  vector<int> a(n); 
  for (int i = 0; i < n; ++i) {
    cin >> a[i]; 
  }
  build(0, 0, n - 1, a); 
  vector<vector<pair<int, int>>> vec(n); 
  stack<int> stk; 
  for (int i = 0; i < n; ++i) {
    while (!stk.empty() && a[stk.top()] < a[i]) {
      if (2 * i - stk.top() < n) {
        vec[stk.top()].emplace_back(2 * i - stk.top(), a[i] + a[stk.top()]);
        //upd(0, 0, n - 1, 2 * i - stk.top(), a[i] + a[stk.top()]);         
      }
      stk.pop(); 
    }
    if (!stk.empty()) {
      if (2 * i - stk.top() < n) {
        vec[stk.top()].emplace_back(2 * i - stk.top(), a[i] + a[stk.top()]);
        //upd(0, 0, n - 1, 2 * i - stk.top(), a[i] + a[stk.top()]);         
      }
    }
    stk.push(i); 
  }
  int q;
  cin >> q; 
  vector<int> ans(q); 
  vector<vector<pair<int, int>>> qs(n); 
  for (int i = 0; i < q; ++i) {
    int l, r;
    cin >> l >> r;
    --l, --r;
    qs[l].emplace_back(r, i); 
  }
  for (int l = n - 1; l >= 0; --l) {
    for (auto [p, s] : vec[l]) {
      upd(0, 0, n - 1, p, s); 
    }
    for (auto [r, i] : qs[l]) {
      ans[i] = qry(0, 0, n - 1, 0, r).ans; 
    }
  }
  for (int i = 0; i < q; ++i) {
    cout << ans[i] << '\n'; 
  }
  return 0;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 14.0

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

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 126 ms 25940 KB Output is correct
2 Correct 71 ms 24920 KB Output is correct
3 Correct 74 ms 25796 KB Output is correct
4 Correct 123 ms 26192 KB Output is correct
5 Correct 122 ms 25936 KB Output is correct
6 Correct 124 ms 25464 KB Output is correct
7 Correct 119 ms 25436 KB Output is correct
8 Correct 121 ms 25328 KB Output is correct
9 Correct 141 ms 25680 KB Output is correct

Subtask #4
0 / 54.0

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