【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=,f=;
    char c=getchar();
    while(c<||<c) {if(c=='-') f=-; c=getchar();}
    while(<=c&&c<=) v=(v<<)+v+v+c-,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=;i<=k;i++) scanf("%lld",&a[i]);
         for(int i=k+;i<=n;i++) a[i]=(a[i-]*P+Q*i+R)%MOD;
         int head=,tail=;
         ll ans1=,ans2=;
         for(int i=n;i>=;i--)
         {
             while((head<=tail)&&(a[q[tail]]<=a[i])) tail--;
             q[++tail]=i;
             if(i+m-<=n)
             {
                 while(q[head]>=i+m) head++;
                 ans1+=i^a[q[head]];
                 ans2+=i^(tail-head+);
             }
         }
         printf("%lld %lld\n",ans1,ans2);
     }
 }