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): 2933    Accepted Submission(s): 924

 

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=−1and 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

题解：

维护一个区间的最大值 就想到单调队列 但是同时要找到最大值的变化次数 从前往后单调队列无法解决这个问题

所以我们从后往前 维护单调递减队列

最后 最大值就是队头元素，变化次数就是此时队列的长度

 

#include <cstdio>
#include <algorithm>
#include <math.h>
#include <string.h>
#include <vector>
#include <iostream>
#define ll long long
#define INF 0x3f3f3f
using namespace std;
const int N=10000010;

int a[N],b[N];
int main()
{
    ll A,B;
    int t,n,m,k,p,q,r,mod,i,head,tail;
    scanf("%d",&t);
    while(t--)
    {
        A=B=0;
        scanf("%d%d%d%d%d%d%d",&n,&m,&k,&p,&q,&r,&mod);
        for(i=1;i<=k;i++)
            scanf("%d",&a[i]);
        for(i=k+1;i<=n;i++)
            a[i]=((ll)p*a[i-1]+(ll)q*i+r)%mod;

        head=tail=0;
        for(i=n;i>=1;i--)
        {
            while(tail>head && a[i]>=a[b[tail-1]]) tail--;
            b[tail++]=i;
            if(i>n-m+1) continue;
            while(b[head]-i+1>m && tail>head) head++;
            A+= (ll)i^(ll)a[b[head]];
            B+= (ll)i^(ll)(tail-head);
        }
        printf("%lld %lld\n",A,B);
    }
    return 0;
}