Submission #19830596

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;

int op(int a, int b){ return max(a, b); }
int e() { return -1; }
int target;
bool f(int val){ return val < target; }
int main()
{
  int n, q;
  cin >> n >> q;
  segtree<int, op, e> seg(n);
  for (int i = 0; i < n; i++){
    int t;
    cin >> t;
    seg.set(i, t);
  }
  for (int i = 0; i < q; i++){
    int t, x, y;
    cin >> t >> x >> y;
    x--;
    switch(t){
    case 1:
      seg.set(x, y);
      break;
    case 2:
      cout << seg.prod(x, y) << endl;
      break;
    case 3:
      target = y;
      cout << seg.max_right<f>(x) + 1 << endl;
      break;
    }    
  }
  return 0;
}

Submission Info

Judge Result