题意:
给一个长为k的序列,按照规则构造出长为n的序列后,求每一个长为m的区间[L,R]中,sigma(L^max(a[L,R]))和sigma(L^(从L到R取最大值的更新次数))。
思路:
从后往前维护一个双端队列,记录下标i,当扫描到一个a[i]比队尾元素大的时候,将队尾元素出队,直到队尾元素大于a[i],这样就可以知道扫描过区间的最大值维护次数。
当到达一个区间左端点的时候,将队首超出右端点的数出队,这样队列长度就是[L,R]的最大值更新次数,队首元素就是最大值。
代码:
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <map>
#include <list>
#include <set>
#include <stack>
#include <queue>
#include <string>
#include <sstream>
#define pb push_back
#define X first
#define Y second
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin())
#define pii pair<int,int>
#define qclear(a) while(!a.empty())a.pop();
#define lowbit(x) (x&-x)
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define mst(a,b) memset(a,b,sizeof(a))
#define cout3(x,y,z) cout<<x<<" "<<y<<" "<<z<<endl
#define cout2(x,y) cout<<x<<" "<<y<<endl
#define cout1(x) cout<<x<<endl
#define IOS std::ios::sync_with_stdio(false)
#define SRAND srand((unsigned int)(time(0)))
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
using namespace std;
const double PI=acos(-1.0);
const int INF=0x3f3f3f3f;
//const ll mod=1e9+7;
const double eps=1e-8;
const int maxn=1e7+5;
const int maxm=10005;
int n,m,k,p,q,r,mod;
int a[maxn];
int dque[maxn];
int head,tail;
void solve() {
int t;
sd(t);
while(t--){
sddd(n,m,k);
sdd(p,q);
sdd(r,mod);
for(int i=1;i<=k;i++){
sd(a[i]);
}
for(int i=k+1;i<=n;i++){
a[i]=((ll)a[i-1]*p%mod+(ll)q*i%mod+r)%mod;
}
head=tail=0;
ll ans1=0,ans2=0;
for(int i=n;i>=1;i--){
while(head<tail&&a[dque[tail-1]]<=a[i])tail--;
dque[tail++]=i;
if(i<=n-m+1){
while(dque[head]>=i+m)head++;
ans1+=(i^a[dque[head]]);
ans2+=(i^(tail-head));
}
}
printf("%lld %lld\n",ans1,ans2);
}
return ;
}
int main() {
#ifdef LOCAL
freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
#else
// freopen("","r",stdin);
// freopen("","w",stdout);
#endif
solve();
return 0;
}