Codeforces Round #550 (Div. 3) D. Equalize Them All(思维)

#include <bits/stdc++.h>
#define ll long long
using namespace std;
int n,m;
ll pre[200005];
map<ll,int> ma;

int main()
{
  scanf("%d",&n);
  int ans = 0;
  int pos, pos2;
  for(int i=1;i<=n;i++){
    scanf("%lld", &pre[i]);
    ma[pre[i]] ++;
    if(ans <= ma[pre[i]]){
      ans = ma[pre[i]];
      pos = pre[i];
      pos2 = i;
    }
  }
  printf("%d\n", n - ans);
  if(ans == n) return 0;
  int p = pos2 + 1;
  while(p <= n){
    if(pre[p] != pos){
      if(pre[p] < pos){
        cout<<"1 "<<p<<" "<<p-1<<endl;
      }
      else{
        cout<<"2 "<<p<<" "<<p-1<<endl;
      }
    }
    p ++;
  }
  p = pos2 - 1;
  while(p >= 1){
    if(pre[p] != pos){
      if(pre[p] < pos){
        cout<<"1 "<<p<<" "<<p+1<<endl;
      }
      else{
        cout<<"2 "<<p<<" "<<p+1<<endl;
      }
    }
    p--;
  }
  return 0;
}