HDU 4669 Mutiples on a circle 动态规划

参考了官方题解给的方法：

对于处理循环，官方给了一种很巧妙的方法：

#include <cstdio>
#include <cstring>
#include <cstdlib>

#define LL long long int

const int MAXN = ;
const int MAXMOD = ;

int N, K;
int dp[MAXN][MAXMOD];
int val[MAXN];
int fac[MAXN << ];
int len[];

void init()
{
    for ( int i = ; i < ; ++i ) len[i] = ;
    for ( int i = ; i < ; ++i ) len[i] = ;
    for ( int i = ; i < ; ++i ) len[i] = ;
    for ( int i = ; i < ; ++i ) len[i] = ;
    return;
}

void GetFac()
{
    fac[] = ;
    int lenn = (N << );
    for ( int i = ; i < lenn; ++i )
        fac[i] = ( fac[i - ] *  ) % K;
    return;
}

int main()
{
    //freopen( "1004.in", "r", stdin );
    //freopen( "ss.out", "w", stdout );
    init();
    while ( ~scanf("%d%d", &N, &K ) )
    {
        for ( int i = ; i < N; ++i )
            scanf( "%d", &val[i] );
        GetFac();

        val[N] = val[];
        int sum = ;
        int totL = ;

        //不要用memset，否则会超时
        for ( int i = ; i <= N; ++i )
            for ( int j = ; j <= K; ++j )
                dp[i][j] = ;

        for ( int i = N; i > ; --i )
        {
            sum = ( val[i] * fac[totL] + sum ) % K;
            totL += len[ val[i] ];
            ++dp[][sum];
        }

        LL ans = dp[][];
        for ( int i = ; i < N; ++i )
        {
            for ( int j = ; j < K; ++j )
                dp[i][ ( j * fac[ len[ val[i] ] ] + val[i] ) % K ] += dp[i - ][j];
            sum = ( sum * fac[ len[ val[i] ] ] + val[i] ) % K;
            --dp[i][sum];
            ++dp[i][ val[i]%K ];
            sum = ( ( sum - val[i] * fac[totL] ) % K + K ) % K;
            ans += dp[i][];
        }

        printf( "%I64d\n", ans );
    }
    return ;
}