Topic Portal // res tp hdu
Maintenance monotonically incrementing the queue
based on the data range is estimated to be O (n) is.
We need to maintain information of a section, the section information is "orderly", while the need for information transfer section adjacent to O (1) time .
if the main number sequence from start to finish could not have transferred solving a breakthrough to turn the head from the tail rethinking.
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i = (a);i>=(b);--i)
#define fo(i,a,b) for(int i =(a);i<(b);++i)
#define de(x) cout<<#x<<" = "<<x<<endl;
#define endl '\n'
#define ls(p) ((p)<<1)
#define rs(p) (((p)<<1)|1)
using namespace std;
typedef long long ll;
const int mn = 1e7+10;
int T;
ll a[mn];
ll n,m,k,p,q,r,MOD;
int L,R;
int tmaxr;
ll A,B;
ll val[mn];
int pos[mn];
int main(){
scanf("%d",&T);
while(T--){
A = B = 0;
scanf("%lld %lld %lld %lld %lld %lld %lld",&n,&m,&k,&p,&q,&r,&MOD);
rep(i,1,k) scanf("%lld",&a[i]);
if(k<n)
rep(i,k+1,n) a[i] = (p*a[i-1]+q*i+r)%MOD;
L = R = n-m+1;
val[L] = a[L]; pos[L] = L;
tmaxr = a[L];
int tem = n-m+2;
rep(i,tem,n) if(a[i] > tmaxr){
++R;
val[R] = a[i]; pos[R]=i;
tmaxr = a[i];
}
A += L^tmaxr;
B += L^(R-L+1);
tem-=2;
per(i,tem,1){
while(L<=R&&pos[R] > i + m - 1){
R--;
}
if(a[i] >= a[i+1]){
while(L<=R&&val[L] <= a[i]){
L++;
}
}
L--;
val[L]=a[i];pos[L]=i;
A += val[R]^i;
B += (R - L + 1)^i;
}
printf("%lld %lld\n",A,B);
}
}