CF574EOpenStreetMap

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;

const int N=3005;
int n,m,a,b;
int q[N*N];
long long h[N][N],g[N],ans,t[N][N],x,y,z;

int main()
{
    scanf("%d%d%d%d",&n,&m,&a,&b);
    scanf("%lld%lld%lld%lld",&g[0],&x,&y,&z);
    for (int i=1;i<=n*m;i++) g[i]=(g[i-1]*x+y)%z;
    for (int i=1;i<=n;i++) {
        for (int j=1;j<=m;j++) {
            h[i][j]=g[(i-1)*m+j-1];
        }
    }
    for (int i=1;i<=n;i++) {
        int head=1,tail=0;
        for (int j=1;j<=m;j++) {
            while (head<=tail&&j-q[head]>=b) head++;
            while (head<=tail&&h[i][q[tail]]>h[i][j]) --tail;
            q[++tail]=j;
            t[i][j]=h[i][q[head]];
        }
    }
    for (int j=1;j<=m;j++) {
        int head=1,tail=0;
        for (int i=1;i<=n;i++) {
            while (head<=tail&&i-q[head]>=a) head++;
            while (head<=tail&&t[q[tail]][j]>t[i][j]) --tail;
            q[++tail]=i;
            if (i>=a&&j>=b) ans+=t[q[head]][j];
        }
    }
    cout << ans << endl;
    return 0;
}