HDU - 6630 permutation 2 2019杭电多校(DP写法）

题意：有三个正整数n,x,y。
请计算有多少个排列1∼n满足以下条件:
p1 = x pn = y 且相邻数字绝对值不超过2。
思路：
从x开始肯定要先往下走到1，然后往上到x+1。y肯定得往上到n然后往下到y-1。（x和y为端点要特判）。
所以能变的数字只有区间[x+2,y-2]，且满足端点相邻数字绝对值小于2.
设区间长度为len。dp[0][i]代表i和i+1不交换的状态种数，dp[1][i]为交换的种数。

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 100;
typedef long long ll;
const ll mod = 998244353;
ll dp[2][maxn];
ll sun(int len) {
    dp[0][1] = 1; dp[1][1] = 1;
    dp[0][2] = 1; dp[1][2] = 1;
    dp[0][3] = 2; dp[1][3] = 1;
    for(int i = 4; i < len; i++) {
        dp[0][i] = (dp[1][i - 2] + dp[0][i - 2] + dp[1][i - 3]) % mod;
        dp[1][i] = (dp[0][i - 2] + dp[1][i - 3]) % mod;
    }
}

int main() {
//    freopen("in.txt", "r", stdin);
    ios::sync_with_stdio(false);
    int T; cin >> T;
    int n, x, y;
    sun(maxn);
    while(T--) {
        cin >> n >> x >> y;
        int l = x + 2; if(x == 1) l = x + 1;
        int r = y - 2; if(y == n) r = n - 1;
        int len = r - l + 1;
        if(len < -1) {
            cout << 0 << endl;
            continue;
        }
        if(len == -1 || len == 0 || len == 1) {
            cout << 1 << endl;
            continue;
        }
        if(len == 2) {
            cout << 2 << endl;
            continue;
        }
        cout << ((dp[1][len - 2] + dp[0][len - 1]) % mod + dp[1][len - 1]) % mod << endl;
    }
    return 0;
}

下面是找规律的代码a[i] = a[i-1]+a[i-3]

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <time.h>
#include <algorithm>
typedef long long ll;
using namespace std;
const ll mod = 998244353;
const int maxn = 3e5 + 100;

ll a[maxn];

int main() {
//    freopen("in.txt", "r", stdin);
//    freopen("out.txt","w",stdout);
    a[0] = 0;
    a[1] = 1;
    a[2] = 1;
    a[3] = 1;
    a[4] = 2;
    a[5] = 3;
    a[6] = 4;
    a[7] = 6;
    for(int i = 6; i <= 100000; i++)
        a[i] = (a[i - 1] + a[i - 3]) % mod;
    int t;
    scanf("%d", &t);
    while(t--) {
        ll n, x, y;
        scanf("%lld%lld%lld", &n, &x, &y);

        int l = x + 1;
        if(x == 1) l = 1;

        int r = y - 1;
        if(y == n) r = n;

        printf("%lld\n", a[r - l + 1]);
    }
    return 0;
}