hdu 6319 Problem A. Ascending Rating （2018 Multi-University Training Contest 3）

#include <stdio.h>
#include <iostream>
#include <cstdlib>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

#define Faster ios::sync_with_stdio(false),cin.tie(0)
#define Read freopen("in.txt", "r", stdin),freopen("out.txt", "w", stdout)
const int INF = 0x3f3f3f3f;
const int maxn = 1e7 + 5;

ll n, m, k, p, q, MOD, r;
ll a[maxn];
ll b[maxn];

int main() 
{
    Faster;
    int T;
    cin >> T;
    while(T--){
        cin >> n >> m >> k >> p >> q >> r >> MOD;
        for(int i = 1;i <= n;i++){
            if(i <= k){
                cin >> a[i];
            }
            else{
                a[i] = (p*a[i-1] + q*i + r)%MOD;
            }
        }
        ll cnt, ans;
        cnt = ans = 0;
        for(int h = 1, t = 0, i = n;i >= 1;i--){
            while(h <= t && a[b[t]] <= a[i]) t--;
            b[++t] = i;
            if(i+m-1 <= n){
                while(b[h] >= i+m) h++;
                ans += i^a[b[h]];
                cnt += i^(t-h+1);
            }
        }
        cout << ans << " " << cnt << endl;
    }
    return 0;
}