数组切分（递推）（2022蓝桥）

数组切分 - 蓝桥云课 (lanqiao.cn)

满足条件为 一段区间的最大值-最小值 == 区间长度

#include <iostream>
#include <bits/stdc++.h>
#include <cstring>
#include <vector>
#include <algorithm>
#define x first
#define y second
#define fu(i,a,b) for(int i=a;i<=b;i ++ )
#define fd(i,a,b) for(int i=a;i>=b;i -- )
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;

typedef long long LL;
typedef pair<int,int> PII;
typedef pair<double,double> PDD;
typedef pair<double,int> PDI;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<LL,LL> PLL;
//typedef __int128 i128;
typedef unsigned long long ULL;
const int N = 1e5+ 10,M = 1e5 + 10,INF = 0x3f3f3f3f ;
const int mod = 1e9 + 7 ;
const double eps = 1e-8;

int n,a[N],f[N];


inline void solve()
{
    cin >> n; 
    fu(i,1,n) cin >> a[i];
    f[0] = 1; 
    
    fu(i,1,n)
    {
        int d = n + 1, u =0;
        fd(j,i,1)
        {
            d = min(d,a[j]),u = max(u,a[j]);
            if(i - j + 1 == u - d + 1 ) 
            f[i] = (f[i] + f[j-1]) % mod;
        }
            
        
    }
    
    
    cout << f[n] << endl;    

}



signed main()
{
//  freopen("1.txt","w",stdout);
     ios

    int t=1;
//    cin>>t;
    int now = 1;
    while(t -- )
    {
//      cout<<"Case "; 
//      cout<<"Case #"; 
//      cout<< now ++ <<": ";
        solve();
    }


    return 0;
}