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): 3103    Accepted Submission(s): 1003

 

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

 

Source

2018 Multi-University Training Contest 3

 

Recommend

chendu   |   We have carefully selected several similar problems for you:  6331 6330 6329 6328 6327 

【思路】

滑动窗口，从右往左考虑，用一个单调队列维护值递减的元素下标，窗口内的元素个数就是count，对头元素对应的值就是maxrating。

 

【代码】

//******************************************************************************
// File Name: A.cpp
// Author: Shili_Xu
// E-Mail: shili_xu@qq.com
// Created Time: 2018年07月31日 星期二 13时22分41秒
//******************************************************************************

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;

const int MAXN = 1e7 + 5;

struct deque {
	int head, tail;
	int q[MAXN];

	void init()
	{
		head = tail = 0;
	}

	bool empty()
	{
		return head == tail;
	}

	int size()
	{
		return tail - head;
	}

	int front()
	{
		return q[head];
	}

	int back()
	{
		return q[tail - 1];
	}

	void pop_front()
	{
		head++;
	}

	void push_back(int x)
	{
		q[tail++] = x;
	}

	void pop_back()
	{
		tail--;
	}
};

int t, n, m, k, p, q, r, mod;
int a[MAXN];
deque que;

int main()
{
	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 <= n; i++) {
			if (i <= k)
				scanf("%d", &a[i]);
			else
				a[i] = ((ll)p * a[i - 1] + (ll)q * i + (ll)r) % mod;
		}
		que.init();
		ll A = 0, B = 0;
		for (int i = n; i >= 1; i--) {
			while (!que.empty() && a[i] >= a[que.back()]) que.pop_back();
			que.push_back(i);
			if (!que.empty() && que.front() >= i + m) que.pop_front();
			if (i <= n - m + 1) {
				A += (ll)a[que.front()] ^ (ll)i;
				B += (ll)que.size() ^ (ll)i;
			}
		}
		printf("%lld %lld\n", A, B);
	}
	return 0;
}