forked from mrsac7/CSES-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path2217 - Collecting Numbers II.cpp
50 lines (47 loc) · 1.17 KB
/
2217 - Collecting Numbers II.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
/*
Problem Name: Collecting Numbers II
Problem Link: https://cses.fi/problemset/task/2217
Author: Sachin Srivastava (mrsac7)
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
signed main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#ifdef LOCAL
freopen("input.txt", "r" , stdin);
freopen("output.txt", "w", stdout);
#endif
int n,m; cin>>n>>m;
int l = 1;
int ind[n+2] = {0}, a[n+1] = {0};
ind[n+1] = n+1;
for (int i = 1; i <= n; i++) {
int x; cin>>x;
ind[x] = i;
a[i] = x;
}
int c = 1;
for (int i = 1; i <= n; i++) {
if (l > ind[i])
c++;
l = ind[i];
}
while(m--) {
int x,y; cin>>x>>y;
int r = a[x], s = a[y];
swap(a[x], a[y]);
if (ind[r-1] <= ind[r] && ind[r-1] > y) c++;
if (ind[r-1] > ind[r] && ind[r-1] <= y) c--;
if (ind[r] <= ind[r+1] && y > ind[r+1]) c++;
if (ind[r] > ind[r+1] && y <= ind[r+1]) c--;
ind[r] = y;
if (ind[s-1] <= ind[s] && ind[s-1] > x) c++;
if (ind[s-1] > ind[s] && ind[s-1] <= x) c--;
if (ind[s] <= ind[s+1] && x > ind[s+1]) c++;
if (ind[s] > ind[s+1] && x <= ind[s+1]) c--;
ind[s] = x;
cout<<c<<endl;
}
}