-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path1935B Informatics in MAC.cpp
62 lines (58 loc) · 1.39 KB
/
1935B Informatics in MAC.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
/*
author : MishkatIT
created : Friday 2024-03-08-16.50.02
*/
#include<bits/stdc++.h>
#define fio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define debug(_) cout << #_ << " is " << _ << '\n';
using namespace std;
using ll = long long;
using ld = long double;
const ll mod = 1e9 + 7;
const ll N = 2e5 + 10;
const ll inf = 1e9;
const ll linf = 1e18;
int main()
{
fio;
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<int> v(n);
for (auto& i : v) {
cin >> i;
}
vector<int> pref(n), suf(n);
set<int> s;
int mex = 0;
for (int i = 0; i < n; i++) {
s.insert(v[i]);
while(s.find(mex) != s.end()) mex++;
pref[i] = mex;
}
s.clear();
mex = 0;
for (int i = n - 1; i >= 0; i--) {
s.insert(v[i]);
while(s.find(mex) != s.end()) mex++;
suf[i] = mex;
}
int ans = -1;
for (int i = n - 2; i >= 0; i--) {
if (pref[i] == suf[i + 1]) {
ans = i + 1;
break;
}
}
if (ans == -1) {
cout << -1 << '\n';
} else {
cout << 2 << '\n';
cout << 1 << ' ' << ans << '\n';
cout << ans + 1 << ' ' << n << '\n';
}
}
return 0;
}