HELP!求此题的代码怎么写!

Question

HELP!求此题的代码怎么写!各位大奆能否帮帮忙!貌似是一个模拟问题.

Answer 1

根据条件遍历数据，找出符合p(i-1)>p(i)或者p(i+1)>p(i)的数
运行结果：

代码：

#include <iostream>
using namespace std;

#define MAXLEN 5002

long long g_cnt = 0; //记录个数

//获取数i在数组中的位置
int getPos(int i, int p[], int n)
{
    int j = 1;
    for (; j <= n; j++)
    {
        if (p[j] == i)
            return j;
    }
    return 0;
}



void deal(int p[], int n, int index[], int nmb,int start)
{
    if (start == 0)
    {
        for (int i = 1; i <= n; i++)
        {
            int x = index[start];
            //cout << "p[" << x << "]=" << i << endl;
            p[x] = i;


            if (i == p[n]) continue;
            int t1 = i - 1;
            int t2 = i + 1;
            
            //找到t1、t2的位置
            int p1 = getPos(t1, p, n);
            int p2 = getPos(t2, p, n);

            if( p1 == 0 || p2==0 ) //t1、t2不再p中
                continue;
        
            //判断是否满足条件
            if (p1 > x || p2 > x)
            {
                //cout << "pos(i)="<<x <<",i="<<i << ",t1=" << t1 << ",p1=" << p1 << " t2=" << t2 << ",p2=" << p2 << endl;
                g_cnt++;
            }
        }
    }
    else
    {
        int x = index[start];
        
        for (int i = 1; i < n; i++)
        {
            //cout << "  p[" << x << "]=" << i << ": " << endl;;
            p[x] = i;
            deal(p, n, index, nmb, start - 1);
        }
    }

}






int main()
{
    int p[MAXLEN], i, n;
    int index[MAXLEN], nmb = 0;
    p[0] = 0;
    cin >> n; //输入n
    for (i = 1; i <= n; i++)
    {
        cin >> p[i];
        if (p[i] == 0 )
            index[nmb++] = i; //记录第一次出现0的位置，也就是被擦除的数的位置
    }
        
    deal(p, n, index, nmb, nmb-1);
    
    cout << g_cnt%998244353;
    return 0;
}