【HDOJ6319】Ascending Rating（单调队列）

题意：

思路：

倒着来是因为这样可以维护每一个当过最大值的数，而正着不行

#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<vector>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef vector<int> VI;
#define fi first
#define se second 
#define MP make_pair
#define N   11000000


 
ll a[N];
int q[N];

int read()
{ 
   int v=0,f=1;
   char c=getchar();
   while(c<48||57<c) {if(c=='-') f=-1; c=getchar();}
   while(48<=c&&c<=57) v=(v<<3)+v+v+c-48,c=getchar();
   return v*f;
}

 
int main()
{
    
    int cas;
    scanf("%d",&cas);
    while(cas--)
    {
        int n,m,k;
        ll P,Q,R,MOD;
        scanf("%d%d%d%lld%lld%lld%lld",&n,&m,&k,&P,&Q,&R,&MOD);
        for(int i=1;i<=k;i++) scanf("%lld",&a[i]);
        for(int i=k+1;i<=n;i++) a[i]=(a[i-1]*P+Q*i+R)%MOD;
        int head=1,tail=0;
        ll ans1=0,ans2=0; 
        for(int i=n;i>=1;i--)
        {
            while((head<=tail)&&(a[q[tail]]<=a[i])) tail--;
            q[++tail]=i;
            if(i+m-1<=n)
            {
                while(q[head]>=i+m) head++;
                ans1+=i^a[q[head]];
                ans2+=i^(tail-head+1);
            }
        }
        printf("%lld %lld\n",ans1,ans2);
    }
}