@HDU 6319 @ 杭电多校 第三场 A: Ascending Rating ( 单调队列)

Problem A. Ascending Rating

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

 

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 

 

[题意]

给定一个序列 a[1..n]，对于每个长度为 m 的连续子区间， 求出区间 a 的最大值以及从左往右扫描该区间时 a 的最大值的 变化次数。

[思路]

倒着 考虑,   就变成 一个 下台阶的问题,   啊啊啊啊,   逆向思维..

队列 维护 位置,  寻找区间 就可以了.

 

[代码]

#include <iostream>
#include <bits/stdc++.h>

#define rep(i,a,n) for(int i = a; i < n ; i++)
#define per(i,a,n) for(int i = n-1; i>=a;i--)

/*
*
* Author: SIZ
*
*/
typedef long long ll;

using namespace std;

const int maxn = 1e7 + 2000;


ll a[maxn];
int Q[maxn];
int n,m,k,q,r,p,mod;

int main()
{
    int t;
    scanf("%d",&t);

    while(t--)
    {
        scanf("%d %d %d %d %d %d %d",&n,&m,&k,&p,&q,&r,&mod);
        rep(i,1,k+1)
        {
            scanf("%lld",&a[i]);
        }
        rep(i,k+1,n+1)
        {
            a[i] = (1ll*p*a[i-1]+1ll*q*i+r)%mod;
        }
        int head = 1;
        int top = 0;
        ll ansA = 0, ansB = 0;
        for(int i = n ;i >=1 ; i--)
        {
            while(head<=top&& (a[Q[top]] <= a[i]) )
                top--;
            Q[++top] = i;
            if( (i+m-1) <=n )
            {
                while(Q[head] >= (i+m))
                    head++;
                ansA += i^a[Q[head]];
                ansB += i^ (top-head+1);
            }
        }

        printf("%lld %lld\n",ansA,ansB);
    }

    return 0;
}