（C/C++）递增三元组

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <iostream>

using namespace std;

int a[10005];
int N;
int date_min[10005];
int date_max[10005];


int main()
{
    //freopen("test.in","r",stdin);
    //freopen("test.out","w",stdout);
    
    int i,j;
    int ans = 0;
    
    scanf("%d", &N);
    for (i = 1; i <= N; i++)
    {
        scanf("%d", &a[i]);
        date_min[i] = a[i];
        date_max[i] = a[i];
    }
    
    for(i = 2;i<=N;i++)
    {
        date_min[i] = min(date_min[i-1],date_min[i]);
    } 
    
    for(i = N-1;i>=1;i--)
    {
        date_max[i] = max(date_max[i+1],date_max[i]);
    } 
    
    for(i = 2;i<=N-1;i++)
    {
        if(a[i]>date_min[i-1]&&a[i]<date_max[i+1])
            ans++;
    }

    printf("%d",ans);
    
    return 0;
}