HDU 6319 Problem A. Ascending Rating（单调队列）

Problem A. Ascending Rating

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 1056    Accepted Submission(s): 264

 

Problem Description

Before the start of contest, there are n ICPC contestants waiting in a long queue. They are labeled by 1 to n from left to right. It can be easily found that the i-th contestant's QodeForces rating is ai.
Little Q, the coach of Quailty Normal University, is bored to just watch them waiting in the queue. He starts to compare the rating of the contestants. He will pick a continous interval with length m, say [l,l+m−1], and then inspect each contestant from left to right. Initially, he will write down two numbers maxrating=0 and count=0. Everytime he meets a contestant k with strictly higher rating than maxrating, he will change maxrating to ak and count to count+1.
Little T is also a coach waiting for the contest. He knows Little Q is not good at counting, so he is wondering what are the correct final value of maxrating and count. Please write a program to figure out the answer.

 

 

Input

The first line of the input contains an integer T(1≤T≤2000), denoting the number of test cases.
In each test case, there are 7 integers n,m,k,p,q,r,MOD(1≤m,k≤n≤107,5≤p,q,r,MOD≤109) in the first line, denoting the number of contestants, the length of interval, and the parameters k,p,q,r,MOD.
In the next line, there are k integers a1,a2,...,ak(0≤ai≤109), denoting the rating of the first k contestants.
To reduce the large input, we will use the following generator. The numbers p,q,r and MOD are given initially. The values ai(k<i≤n) are then produced as follows :

ai=(p×ai−1+q×i+r)modMOD

It is guaranteed that ∑n≤7×107 and ∑k≤2×106.

 

 

Output

Since the output file may be very large, let's denote maxratingi and counti as the result of interval [i,i+m−1].
For each test case, you need to print a single line containing two integers A and B, where :

AB==∑i=1n−m+1(maxratingi⊕i)∑i=1n−m+1(counti⊕i)

Note that ``⊕'' denotes binary XOR operation.

 

 

Sample Input

1 10 6 10 5 5 5 5 3 2 2 1 5 7 6 8 2 9

 

 

Sample Output

46 11

 

题意：给你n,m,k,p,q,r,mod。再给你k个数，剩下的n-k个数由题目公式给出。对每个长度为m的连续区间，从前到后依次编号1~n-m+1。求这些区间的最大值异或其区间编号的和  和这些区间从第一个数，碰到一个比它大的数就交换的交换次数异或其区间编号的和。 

思路：比赛的时候可能是石乐志。这tm不就是滑动窗口的变形么。。。比赛的时候傻乎乎的用STL搞了半天没搞出来。。。

如果从后往前维护一个单减的单调队列，那么队列中满足下标i~i+m-1的元素的个数就是要交换的次数。最大值就是队头元素。。。

代码：

#include<bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f
#define pii pair<ll,ll>
using namespace std;
inline ll read()
{
register ll c=getchar(),fg=1,sum=0;
while(c<='9'&&c>='0'){sum=sum*10+c-'0';c=getchar();}
    return fg*sum;
}
const int maxn=10000005;
ll nex[maxn],a[maxn],qq[maxn],t;
ll p,q,r,mo,ans,cnt,j,ctt,n,m,k,i,ma,ct,kk;
int main()
{
    ll T;
    T=read();
    while(T--)
    {
        i=1;
        n=read();m=read();k=read();
        p=read();q=read();r=read();mo=read();
        while(i<=n)
        {
            if(i<=k) a[i]=read();
            else a[i]=(p*a[i-1]+q*i+r)%mo;
            i++;
        }
        ans=cnt=0;
        for(ll h=1,t=0,i=n;i;i--)
        {
            while(h<=t&&a[qq[t]]<=a[i])t--;
            qq[++t]=i;
            if(i+m-1<=n){
               while(qq[h]>=i+m)h++;
               ans+=i^a[qq[h]];
               cnt+=i^(t-h+1);
            }
        }
    printf("%lld %lld\n",ans,cnt);
    }
    return 0;
}