蓝桥杯真题：连号区间数

#include<iostream>
#define N 50000
using namespace std;
int main()
{
	int n, a[N], sum = 0;
	cin >> n;
	for (int i = 0; i < n; i++)
	cin >> a[i];//输入数据
	for (int i = 0; i < n; i++)
	{	int min=a[i], max=a[i];
		for (int j = i; j < n; j++)
		{
			if (a[j] > max)
				max = a[j];
			if (a[j] < min)
				min = a[j];
			if (i == j) sum++;
			else
			{
				if (max-min== j-i)
					sum++;
			}
		}
	}
	cout << sum;
	return 0;
}