首先讀出題意，然後發現這是一道DP，我們可以獲得遞推式為

然後就知道，不行啊，時間復雜度為O(n²),然後又可以根據遞推式看出這裏面可以拆解成多項式乘法，但是即使用了fft，我們還需要做n次多項式乘法，時間復雜度又變成O(n² * log n)，顯然不可以。然後又利用c分治思維吧問題進行拆分問題但是，前面求出來的結果對後面的結果會產生影響，所以我們使用cdq分治思想來解決這個問題，時間復雜度變為O(n * log²n)。

#include<bits/stdc++.h>
using namespace std;

const double pi = acos(-1.0);
const
 
 int mod = 313;
const int maxn = 4e5 + 7;
int in[maxn], dp[maxn];

struct Complex{
    double r,i;
    Complex(double r = 0.0, double i = 0.0):r(r),i(i){};
    Complex operator+(const Complex &rhs){
        return Complex(r + rhs.r, i + rhs.i);
    }
    Complex operator-(const Complex &rhs){
        
 
return Complex(r - rhs.r, i - rhs.i);
    }
    Complex operator*(const Complex & rhs){
        return Complex(r*rhs.r - i*rhs.i, i*rhs.r + r * rhs.i);
    }
}x1[maxn],x2[maxn];

void rader(Complex *F, int len){
    int j = len >> 1;
    for(int i = 1, j = len/2; i < len - 1; i ++){
        
 
if(i < j)swap(F[i], F[j]);
        int k = len / 2;
        while(j >= k){
            j -= k; k /= 2;
        }
        if(j < k) j += k;
    }
}

void FFT(Complex *F, int len, int t){
    rader(F, len);
    for(int h = 2; h <= len; h <<= 1){
        Complex wn(cos(-t*2*pi/h), sin(-t*2*pi/h));
        for(int j = 0; j < len; j += h){
            Complex E(1, 0);
            for(int k = j; k < j + h/2; k ++){
                Complex u = F[k];
                Complex v = E * F[k + h/2];
                F[k] = u + v;
                F[k + h/2] = u - v;
                E = E * wn;
            }
        }
    }
    if(t == -1)
        for(int i = 0; i < len; i ++)
        F[i].r /= len;
}

void cdq(int l, int r){
    if(l == r){
        dp[l] = (in[l]+dp[l])%mod;
        return ;
    }
    int m = l + r>>1;
    cdq(l,m);
    int len1 = r - l + 1;
    int len2 = m - l + 1;
    int len = 1;while(len < (len1 + len2)) len <<= 1;
    for(int i = 0; i < len; i ++) x1[i] = x2[i] = Complex(0,0);
    for(int i = 0; i < len2; i ++) x1[i] = Complex(dp[i + l], 0);
    for(int i = 0; i < len1; i ++) x2[i] = Complex(in[i], 0);
    FFT(x1, len, 1);FFT(x2, len, 1);

    for(int i = 0; i < len; i ++) x1[i] = x1[i] * x2[i];
    FFT(x1, len, -1);
    for(int i = m + 1; i <= r; i ++) dp[i] = (dp[i] + (int)(x1[i - l].r + 0.5)) % mod;
    cdq(m + 1, r);
}

int main(){
    int n;
    while(~scanf("%d",&n), n){
        for(int i = 1; i <= n; i ++){
            scanf("%d",&in[i]);
            in[i] %= mod;
        }
        memset(dp, 0, sizeof(dp));
        cdq(1, n);
        printf("%d\n", dp[n] % mod);
        for(int i = 0; i <= n; i ++)printf("%d ",dp[i]);printf("\n");
    }
    return 0;
}

Shell Necklace (dp遞推改cdq分治 + fft)