// Problem: D. Equalize Them All
// Contest: Codeforces - Codeforces Round #550 (Div. 3)
// URL: https://codeforces.com/problemset/problem/1144/D
// Memory Limit: 256 MB
// Time Limit: 2000 ms
// 2022-03-05 17:06:50
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
using namespace std;
#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define pii pair<int, int>
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair
const ll mod = 1e9 + 7;
inline ll qmi (ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1) ans = ans * a%mod;
a = a * a %mod;
b >>= 1;
}
return ans;
}
inline int read () {
int x = 0, f = 0;
char ch = getchar();
while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
return f?-x:x;
}
template<typename T> void print(T x) {
if (x < 0) putchar('-'), x = -x;
if (x >= 10) print(x/10);
putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
return (a + b) %mod;
}
inline ll inv (ll a) {
return qmi(a, mod - 2);
}
const int N = 2e5 + 10;
int n;
int cnt[N];
int a[200005], b[200005];
vector<pii> c;
struct Node {
int op;
int i, j;
};
void solve() {
// ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
cin >> n;
int maxv = 0, ct = 0;
int dif = 0;
rep(i, 1, n) {
a[i] = read();
c.pb({a[i], i});
cnt[a[i]] ++;
if (ct < cnt[a[i]]) {
ct = cnt[a[i]];
maxv = a[i];
}
}
for (auto t : a) {
if (t != maxv) dif ++;
}
sort(all(c));
vector<Node> ans;
for (auto t : c) {
int idx = t.se, num = t.fi;
if (num == maxv) {
while (idx - 1>= 1 && dif) {
if (a[idx] == maxv) {
if (a[idx - 1] < maxv) {
dif --;
a[idx - 1] = maxv;
ans.pb({1, idx - 1, idx});
}
else if (a[idx - 1] > maxv) {
dif --;
a[idx - 1] = maxv;
ans.pb({2, idx -1 , idx});
}
else {
idx --;
}
}
}
while (idx + 1 <= n && dif) {
if (a[idx] == maxv) {
if (a[idx+ 1] < maxv) {
dif --;
a[idx + 1] = maxv;
ans.pb({1, idx + 1, idx});
}
else if (a[idx + 1] > maxv) {
dif --;
a[idx + 1] = maxv;
ans.pb({2, idx + 1 , idx});
}
idx ++;
}
}
break;
}
}
printf("%d\n", ans.size());
for (auto t : ans) {
printf("%d %d %d\n", t.op, t.i, t.j);
// cout << t.op << " " << t.i << " " << t.j << "\n";
}
}
signed main () {
int t;
t =1;
//cin >> t;
while (t --) solve();
return 0;
}
贪心。找到一个出现次数最多的数,然后让其他数都变成这个数。每一次操作都有贡献。并且这个数能够向左右传播,因此只要找到第一个是C的数就行了