Ilya and a Colorful Walk

一时暴力一时爽，一直暴力一直爽

Ilya lives in a beautiful city of Chordalsk.

There are n houses on the street Ilya lives, they are numerated from 1 to n from left to right; the distance between every two neighboring houses is equal to 1 unit. The neighboring houses are 1 and 2, 2 and 3, …, n−1 and n. The houses n and 1 are not neighboring.

The houses are colored in colors c1,c2,…,cn so that the i-th house is colored in the color ci. Everyone knows that Chordalsk is not boring, so there are at least two houses colored in different colors.

Ilya wants to select two houses i and j so that 1≤i<j≤n, and they have different colors: ci≠cj. He will then walk from the house i to the house j the distance of (j−i) units.

Ilya loves long walks, so he wants to choose the houses so that the distance between them is the maximum possible.

Help Ilya, find this maximum possible distance.

Input
The first line contains a single integer n (3≤n≤300000) — the number of cities on the street.

The second line contains n integers c1,c2,…,cn (1≤ci≤n) — the colors of the houses.

It is guaranteed that there is at least one pair of indices i and j so that 1≤i<j≤n and ci≠cj.

Output
Print a single integer — the maximum possible distance Ilya can walk.

Examples
inputCopy
5
1 2 3 2 3
outputCopy
4
inputCopy
3
1 2 1
outputCopy
1
inputCopy
7
1 1 3 1 1 1 1
outputCopy
4
Note
In the first example the optimal way is to walk from the first house to the last one, where Ilya can walk the distance of 5−1=4 units.

In the second example the optimal way is to either walk from the first house to the second or from the second to the third. Both these ways have the distance of 1 unit.

In the third example the optimal way is to walk from the third house to the last one, where Ilya can walk the distance of 7−3=4 units.

代码：

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<string>
#include<stack>
#include<queue>
#include<map>
#include<vector>
#include<set>
#include<iostream>
#include<algorithm>
using namespace std;

int main() {
	int n;
	while (cin >> n) {
		int a[300005];
		int length = 0;	
		int i;
		for (i = 0; i < n; i++) {
			cin >> a[i];
		}
		int x;
		if(a[0]!=a[n-1]){	//判断第一个和最后一个是否相等
			printf("%d\n",n-1);
			continue;
		}
		for(i=1;i<n;i++){//不相等的话从头跑一个和第一个不一样的，算出它到最后的距离存到x
			if(a[i]!=a[i-1]){
				x=n-i-1;
				break;
			}
		}
		int y;
		for(i=n-2;i>=0;i--){//再从后面跑一个和最后一个不一样的，算出它到第0个的距离
			if(a[i]!=a[i+1]){
				y=i;
				break;
			}
		}
		if(x>y){//哪个大输出哪个
			printf("%d\n",x);
		}
		else{
			printf("%d\n",y);
		}
	}
}