E - Median String 题解（进制转换）

题目

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
inputCopy

5
2 4 6 6 6

outputCopy

2
1 2 3 
1 1 2 

inputCopy

3
2 8 10

outputCopy

2
2 2 1 
2 3 2 

inputCopy

4
1 1 1 1

outputCopy

0

分析

这道题就是进行26进制数的计算，而且比较简单，只有加法和除法。具体做法就是先求起点和终点的26进制的和，和除以2的值就是所求答案。

具体细节请看我的代码注释哦~

代码

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#define LL long long 
 
using namespace std;
const int maxn = 200010;
 
char s[maxn],t[maxn]; 
int a[maxn],b[maxn]; 
int ans[maxn]; 
int main()
{
	int n;
	scanf("%d",&n);
	scanf("%s",s+1);
	scanf("%s",t+1);
	
	for(int i = 1;i <= n;i++) //计算每个字母对应的26进制数，从'a'对应0开始 
	{
		a[i] = s[i]-'a';
		b[i] = t[i]-'a';
	}
	
	for(int i = n;i >= 1;i--)
	{
		a[i] += b[i]; //26进制加法 
		if(a[i] >= 26)
		{
			a[i-1] += a[i]/26; //会产生进位 
			a[i] %= 26;
		}
		
	}
	
	for(int i=0;i<=n;i++)
	{
		ans[i] = a[i]/2; //取中间数 
		int m = a[i]%2;
		a[i+1] += m*26; //进位要还原 
	}
	for(int i = 1;i <= n;i++)
	{
		printf("%c",ans[i]+'a');
	}
	printf("\n");
	
	return 0;
}

传送门

E - Median String

传走了，可别忘了点赞啊~