The 2018 ACM-ICPC China JiangSu Provincial Programming Contest G. Window

题目：https://nanti.jisuanke.com/t/28871
题意：有一个长度为n的序列，长度为m的划窗，计算每个划窗内乘积的和。

分析：注意不能用前缀积相除，因为可能不存在逆元。正解是把序列按长度m分成若干段，计算每段内的前缀积和后缀积，任意位置的乘积可以由一段前缀积和后缀积拼出，复杂度为O(n)，细节见代码。

代码：

#pragma comment(linker, "/STACK:102400000,102400000")///手动扩栈
#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cassert>
#include<string>
#include<cstdio>
#include<bitset>
#include<vector>
#include<cmath>
#include<ctime>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<set>
#include<map>
using namespace std;
#define debug test
#define mst(ss,b) memset((ss),(b),sizeof(ss))
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define inf 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
typedef pair<int,int> PII;
const ll mod = 1e9+7;
const int N = 1e6+10;

ll gcd(ll p,ll q){return q==0?p:gcd(q,p%q);}
ll qp(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
int to[4][2]={{-1,0},{1,0},{0,-1},{0,1}};

ll n,m,p,x,y,z,a[N],b[N];

int main() {
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    while(cin>>n>>m>>p>>a[1]>>x>>y>>z) {
        ll sum=0,ans=0;
        for(int i=2;i<=n;i++) a[i] = (x*a[i-1]%p*a[i-1]%p+y*a[i-1]%p+z)%p;
        int j=0;
        for(int i=m;i<=n;i++) {
            (sum*=a[i])%=p;
            if(i-m+1>j) {
                sum=1;
                j=i;
                b[i]=a[i];
                for(int k=i-1;k>=i-m+1;k--) b[k]=b[k+1]*a[k]%p;
            }
            ans+=(sum*b[i-m+1])%p;
        }
        cout<<ans<<endl;
    }
    return 0;
}