hdu 3706 Second My Problem First（单调队列）

给出n,a,b，可以算出一个S序列，然后就像滑动窗口那样求出每个$S_i-S_{i+a-1}$ 的最小值，然后乘积mod b

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int MAXN = 1e7+10;
int num[MAXN];
int dque[MAXN];
int n,a,b,s,t;

int main()
{
    LL res,cur;
    while(scanf("%d %d %d",&n,&a,&b) != EOF)
    {
        s = t = 0;
        res = cur = 1;
        for(int i = 1; i <= n; ++i)
        {
            cur = cur*a%b;
            num[i] = cur;
            while(s < t && num[dque[t-1]] >= num[i])
                --t;
            dque[t++] = i;
            while(dque[s] < i-a)
                ++s;
            res = res*num[dque[s]]%b;
        }
        printf("%I64d\n",res);
    }
    return 0;
}