#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ll> vll;
#define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define pb push_back
#define uniq(x) sort(all(x)); (x).resize(unique(all(x)) - (x).begin())
#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif // LOCAL
const int INF = 1e9 + 7;
const int K = 1024;
struct Element{
int x;
int pos_order;
int sp;
};
struct SegTree{
vector<int> tree;
SegTree()
{
tree.resize(4 * K);
}
void __Add(int l, int r, int x, int L, int R, int V)
{
if (l <= L && R <= r)
{
tree[V] += x;
return;
}
if (r <= L || R <= l)
{
return;
}
int M = (L + R) / 2;
__Add(l, r, x, L, M, 2 * V + 1);
__Add(l, r, x, M, R, 2 * V + 2);
tree[V] = max(tree[2 * V + 1], tree[2 * V + 2]);
}
int Add(int l, int r, int x)
{
__Add(0, r, x, 0, K, 0);
}
int Get()
{
return tree[0];
}
void build(int L, int R, int V, vector<Element> &val)
{
if (L + 1 == R)
{
tree[V] = val[L].sp;
return;
}
int M = (L + R) / 2;
build(L, M, 2 * V + 1, val);
build(M, R, 2 * V + 2, val);
tree[V] = max(tree[2 * V + 1], tree[2 * V + 2]);
}
void destroy(int L, int R, int V, vector<Element> &val)
{
if (L + 1 == R)
{
val[L].sp = tree[V];
return;
}
int M = (L + R) / 2;
destroy(L, M, 2 * V + 1, val);
destroy(M, R, 2 * V + 2, val);
}
};
bool comp(Element a, Element b)
{
return a.x < b.x;
}
struct Block{
SegTree d;
vector<Element> a;
Block()
{
a.resize(K);
for (int i = 0; i < K; i++)
{
a[i].x = INF;
a[i].pos_order = i;
}
}
int cntmore(int x)
{
int L = -1, R = a.size();
while (L + 1 < R)
{
int M = (L + R) / 2;
if (a[M].x > x)
R = M;
else
L = M;
}
return K - R;
}
void change(int pos_in_block, int initial, int A)
{
d.destroy(0, K, 0, a);
int id = 0;
for (int i = 0; i < K; i++)
{
if (a[i].pos_order == pos_in_block) id = i;
}
int Z = a[id].x;
for (int i = 0; i < K; i++)
{
if (a[i].pos_order < pos_in_block)
{
if (a[i].x > A) initial++;
}
if (a[i].pos_order > pos_in_block)
{
a[i].sp -= Z > a[i].x;
a[i].sp += A > a[i].x;
}
}
a[id].x = A;
a[id].sp = initial;
while (id > 0 && a[id - 1].x > a[id].x) swap(a[id - 1], a[id]), id--;
while (id + 1 < K && a[id + 1].x < a[id].x) swap(a[id + 1], a[id]), id++;
d.build(0, K, 0, a);
}
void query(int x, int val)
{
int L = -1, R = K;
while (L + 1 < R)
{
int M = (L + R) / 2;
if (a[M].x < x)
L = M;
else
R = M;
}
d.Add(0, L + 1, val);
}
};
vi countScans(vi a, vi x, vi v)
{
int n = a.size(), q = x.size();
vi ans(q);
vector<Block> data(n / K + 1);
for (int i = 0; i < n; i++)
{
int bl = i / K;
int ps = i % K;
int initial = 0;
for (int j = 0; j < bl; j++) initial += data[j].cntmore(a[i]);
data[bl].change(ps, initial, a[i]);
}
for (int i = 0; i < q; i++)
{
int bl = x[i] / K;
int ps = x[i] % K;
int initial = 0;
for (int j = 0; j < bl; j++) initial += data[j].cntmore(v[i]);
data[bl].change(ps, initial, v[i]);
int fr = a[x[i]];
int to = v[i];
a[x[i]] = v[i];
for (int j = bl + 1; j < n / K + 1; j++) data[j].query(fr, -1);
for (int j = bl + 1; j < n / K + 1; j++) data[j].query(to, 1);
int answer = 0;
for (int j = 0; j < n / K + 1; j++) answer = max(answer, data[j].d.Get());
ans[i] = answer;
}
return ans;
}
#ifdef LOCAL
signed main()
{
int n, q;
cin >> n >> q;
vi a(n), x(q), v(q);
forn(i, n) cin >> a[i];
forn(i, q) cin >> x[i] >> v[i];
vi ans = countScans(a, x, v);
forn(i, q) cout << ans[i] << "\n";
}
#endif // LOCAL
/*
10 10
1 2 3 4 5 1 2 3 4 5
0 10
1 9
2 8
3 7
4 6
5 5
6 4
7 3
8 2
9 1
*/
Compilation message
bubblesort2.cpp: In member function 'int SegTree::Add(int, int, int)':
bubblesort2.cpp:65:5: warning: no return statement in function returning non-void [-Wreturn-type]
}
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
24 ms |
384 KB |
Output is correct |
| 2 |
Correct |
31 ms |
384 KB |
Output is correct |
| 3 |
Incorrect |
71 ms |
384 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
24 ms |
384 KB |
Output is correct |
| 2 |
Correct |
31 ms |
384 KB |
Output is correct |
| 3 |
Incorrect |
71 ms |
384 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
547 ms |
1280 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
24 ms |
384 KB |
Output is correct |
| 2 |
Correct |
31 ms |
384 KB |
Output is correct |
| 3 |
Incorrect |
71 ms |
384 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
