1210. 连号区间数

#include
using namespace std;
const int M = 10010;
int arr[M];
int N;
int Max,Min;
int num = 0;
int main()
{
    cin >> N;
    num += N;
    for (int i = 1; i <= N; i++)
    {
        cin>>arr[i];
    }
    for (int i = 1; i <= N; i++)
    {
        Max = arr[i];
            Min = arr[i];
        for (int j = i+1; j <= N; j++)
        {
            
            if (arr[j] > Max)Max = arr[j];
            if (arr[j] < Min)Min = arr[j];
//如果两者的相差相等就等价于区间是连续的
            if (Max - Min == j - i||Max-Min==i-j)
            {
                num++;
            }
        }
    }
    cout << num;
    return 0;
}