The Best Peak Shape

#include<iostream> 
#include<vector>
#include<cmath>
using namespace std;
int main(){
	int n;
	scanf("%d",&n);
	vector<int> forward(n+1,0),backward(n+1,0),input(n+1,0);
	for(int i=1;i<=n;i++)
		scanf("%d",&input[i]);
	for (int i = 2; i <= n; i++) {
		for (int j = i - 1; j >= 1; j--) {
			if (input[i] > input[j]) {
				forward[i] = max(forward[i], forward[j] + 1);
			}
		}
	}
	for (int i = n - 1; i >= 1; i--) {
		for (int j = i + 1; j <= n; j++) {
			if (input[i] > input[j]) {
				backward[i] = max(backward[i], backward[j] + 1);
			}
		}
	} 	
	int maxLen=0,index=0,mindif=100000;
	for(int i=2;i<n;i++){
		if(forward[i]&&backward[i]){
			if(forward[i]+backward[i]+1>maxLen){
				maxLen=forward[i]+backward[i]+1;
				index=i;
				mindif=abs(forward[i]-backward[i]);
			}else if(forward[i]+backward[i]+1==maxLen&&mindif>abs(forward[i]-backward[i])){
				mindif=abs(forward[i]-backward[i]);
				index=i;
			}	
		}
	 }
	if(maxLen)
	 	printf("%d %d %d\n",maxLen,index,input[index]);
	else 
		printf("No peak shape");//千千万万不要打错字母！！！1
	return 0;
}