杭电多校第三场 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): 1374    Accepted Submission(s): 380

 

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

 

 

Source

2018 Multi-University Training Contest 3

题意：一个长度为n的序列，输入给出来k个数，剩下的n-k+1个数由递推公式得出， 求出所有区间[i，i+m+1]的最大值异或 i 的和和在这一个区间最大值变化次数异或 i 的和，这道题会卡MOD

思路：求最大值比较简单，直接利用单调队列就行，求最大值变化次数要从后向前用单调队列维护

#include <bits/stdc++.h>

using namespace std;

typedef long long LL;
const int MAXN = 10000005;
const int INF = 0x3f3f3f3f;

int a[MAXN],Que[5 * MAXN];

int main(void)
{
    int n,m,k,p,q,r,MOD;
    int T;
    scanf("%d",&T);
    while(T--) {
        scanf("%d %d %d %d %d %d %d",&n,&m,&k,&p,&q,&r,&MOD);
        for(int i = 1; i <= k; i++) scanf("%d",&a[i]);
        for(int i = k + 1; i <= n; i++) {
            a[i]=(1LL * p * a[i-1] + 1LL * q * i + 1LL * r) % MOD;
        }
        int Front = 0,Tail = 0;
        LL ans1 = 0,ans2 = 0;
        for(int i = n; i >= 1; i--) {
            while(Front < Tail && a[Que[Tail - 1]] <= a[i]) Tail--;
            Que[Tail++] = i;
            while(Que[Front] > i + m - 1) Front++;
            if(i <= n - m + 1) {
                ans1 += (1LL * a[Que[Front]]) ^ (1LL * i);
                ans2 += (1LL * (Tail - Front)) ^ (1LL * i);
            }
        }
        printf("%lld %lld\n",ans1,ans2);
    }
    return 0;
}