제출 #873879

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
873879		noiaint	Longest beautiful sequence (IZhO17_subsequence)	C++17	0 / 100	1 ms	4444 KiB

subsequence

#include <bits/stdc++.h>

using namespace std;

#define file ""

#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()

#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1LL << (x))
#define popcount __builtin_popcountll

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}

const int N = 1e6 + 5;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;

template<class X, class Y> bool mini(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}

int n, q;
int h[N];
int bit[N];

void update(int u, int c) {
    for (; u < N; u += u & (-u)) bit[u] += c;
}
int get(int u) {
    int res = 0;
    for (; u > 0; u -= u & (-u)) res += bit[u];
    return res;
}
int get(int l, int r) {
    return get(r) - get(l - 1);
}
void update(int l, int r, int c) {
    update(l, c);
    update(r + 1, -c);
}

void add(int i) {
    if (i < 1 || i >= n) return;
    int l = min(h[i], h[i + 1]);
    int r = max(h[i], h[i + 1]);
    update(l, r, 1);
}
void del(int i) {
    if (i < 1 || i >= n) return;
    int l = min(h[i], h[i + 1]);
    int r = max(h[i], h[i + 1]);
    update(l, r, -1);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);

    cin >> n >> q;
    for (int i = 1; i <= n; ++i)
        cin >> h[i];

    for (int i = 1; i <= n; ++i)
        add(i);

    while (q--) {
        int op;
        cin >> op;
        if (op == 1) {
            int pos, newH;
            cin >> pos >> newH;
            del(pos - 1);
            del(pos);
            h[pos] = newH;
            add(pos - 1);
            add(pos);
        }
        else {
            int x;
            cin >> x;
            cout << get(x) << '\n';
        }
    }

    return 0;
}

/*

*/

• Subtask 1: 0 / 7
• Subtask 2: 0 / 16
• Subtask 3: 0 / 17
• Subtask 4: 0 / 60