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

D. Equalize Them All
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
You are given an array a consisting of n integers. You can perform the following operations arbitrary number of times (possibly, zero):
Choose a pair of indices (i,j) such that |i−j|=1 (indices i and j are adjacent) and set ai:=ai+|ai−aj|;
Choose a pair of indices (i,j) such that |i−j|=1 (indices i and j are adjacent) and set ai:=ai−|ai−aj|.
The value |x| means the absolute value of x. For example, |4|=4, |−3|=3.

Your task is to find the minimum number of operations required to obtain the array of equal elements and print the order of operations to do it.

It is guaranteed that you always can obtain the array of equal elements using such operations.

Note that after each operation each element of the current array should not exceed 1018 by absolute value.

Input
The first line of the input contains one integer n (1≤n≤2⋅105) — the number of elements in a.

The second line of the input contains n integers a1,a2,…,an (0≤ai≤2⋅105), where ai is the i-th element of a.

Output
In the first line print one integer k — the minimum number of operations required to obtain the array of equal elements.

In the next k lines print operations itself. The p-th operation should be printed as a triple of integers (tp,ip,jp), where tp is either 1 or 2 (1 means that you perform the operation of the first type, and 2 means that you perform the operation of the second type), and ip and jp are indices of adjacent elements of the array such that 1≤ip,jp≤n, |ip−jp|=1. See the examples for better understanding.

Note that after each operation each element of the current array should not exceed 1018 by absolute value.

If there are many possible answers, you can print any.

Examples
input
5
2 4 6 6 6
output
2
1 2 3
1 1 2
input
3
2 8 10
output
2
2 2 1
2 3 2
input
4
1 1 1 1
output
0

题意就是给了你一堆数 让你通过两个操作让这个数列所有值都相等
操作1 ai+=|ai-aj|
操作2 ai-=|ai-aj|
其中 |i-j|=1
问最少的操作次数 以及操作过程
其实这个题就是个简单的模拟
想一下 我们要最少的操作次数 那么最后目标的这个数一定是出现次数最多的那个
那么我们就可以知道操作次数就是n-m m为众数的出现次数
然后我们要操作过程 我们发现要操作的两个数一定是 相邻的
那么我只要找到一个该众数的位置向两边延展就可以了
如果相等 就不用改了 如果比这个数大 就操作2 如果比这个数小 就操作1

#include<bits/stdc++.h>
using namespace std;

int main()
{
    int n,ma=-1,p,f;
    int a[200010],b[200010];
    memset(b,0,sizeof(b));
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
        b[a[i]]++;
        if(b[a[i]]>ma)
        {
            ma=b[a[i]];
            f=a[i];
            p=i;
        }
    }
    int t=0;
    for(int i=1;i<=n;i++)
        if(a[i]!=f) t++;

    printf("%d\n",t);

    for(int i=p;i>=1;i--)
    {
        if(a[i]==f)
            continue;
        else if(a[i]>f)
            printf("2 %d %d\n",i,i+1);

        else printf("1 %d %d\n",i,i+1);
    }
    for(int i=p;i<=n;i++)
    {
        if(a[i]==f)
            continue;
        else if(a[i]>f) printf("2 %d %d\n",i,i-1);
        else printf("1 %d %d\n",i,i-1);
    }

}