-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1951B.cpp
68 lines (53 loc) · 795 Bytes
/
1951B.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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
void solve() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for(int i=0; i<n; i++){
cin >> v[i];
}
k--;
swap(v[0], v[k]);
int ans1 = 0;
for(int i=1; i<n; i++){
if(v[i] < v[0]){
ans1++;
}
else
break;
}
swap(v[0], v[k]);
int maxVal = 0;
for(int i=0; i<k; i++){
if(v[i] > v[k]){
maxVal = i;
break;
}
}
int ans2 = 0;
if(maxVal > 0){
ans2++;
}
swap(v[maxVal], v[k]);
for(int i=maxVal+1; i<n; i++){
if(v[i] > v[maxVal])
break;
else
ans2++;
}
int ans = max(ans1, ans2);
cout << ans << endl;
return;
}
int32_t main() {
ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
int t = 1;
cin >> t;
while(t--){
solve();
}
return 0;
}