코드#include #include #include #include #include #include #include #include using namespace std;typedef long long ll;const int MAX_N = 200003;int t, n, m;vector tree;void update(int idx, int diff) { while(idx 0) { ans += tree[idx]; idx -= (idx & -idx); } return ans;}void FASTIO() { ios_base::sync_with_stdio(); cin.tie(NULL); cout.tie(NULL);}// 문제에서는 0 0 0 0 0 1, 2,..
