HDU 6319 Ascending Rating 单调队列

Problem A. Ascending Rating

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

 

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

 

---

题意

先给出一个长度为k(k<=n)的序列，和一个递推式，让你先求出整个长度为n的序列，然后对于每个区间都求题目给的式子，其中maxratingi为区间最大值，count为区间上升序列元素个数。对于不同的区间maxratingi和count要重新算。

题解

有个地方

for(int i=k+1;i<=n;i++) arr[i]=(1LL*p*arr[i-1]+1LL*q*i+r)%mod;

正常人都会在乘法后取一次mod 

如果写成这样

for(int i=k+1;i<=n;i++) arr[i]=(1LL*p*arr[i-1]%mod+1LL*q*i%mod+r)%mod;

时限几乎超时

两次的对比

---

代码

#include<stdio.h>
using namespace std;
const int maxn = 1e7+10;
typedef long long ll;
int n,m,k,p,q,r,mod,arr[maxn];
int qu[maxn],head,tail;
ll resa,resb;
int main()
{
    int caset;scanf("%d",&caset);
    while(caset--) {
        scanf("%d%d%d%d%d%d%d",&n,&m,&k,&p,&q,&r,&mod);
        for(int i=1;i<=k;i++) scanf("%d",&arr[i]);
        for(int i=k+1;i<=n;i++) arr[i]=(1LL*p*arr[i-1]+1LL*q*i+r)%mod;
        for(int i=n,head=1,tail=resa=resb=0;i>=1;i--) {
            while(head <= tail && arr[qu[tail]] <= arr[i]) tail--;
            qu[++tail] = i;
            if(i<=n-m+1) {
                while(qu[head] >= i+m) head++;
                resa += i ^ arr[qu[head]];
                resb += i ^ (tail- head + 1);
            }
        }
        printf("%lld %lld\n",resa,resb);
    }
    return 0; 
}