LDU暑假集训（三）1262 Problem A A. Maximum Element In A Stack

As an ACM-ICPC newbie, Aishah is learning data structures in computer science. She has already known that a stack, as a data structure, can serve as a collection of elements with two operations:

• push, which inserts an element to the collection, and

• pop, which deletes the most recently inserted element that has not yet deleted.

Now, Aishah hopes a more intelligent stack which can display the maximum element in the stack dynamically. Please write a program to help her accomplish this goal and go through a test with several operations.

Aishah assumes that the stack is empty at first. Your program will output the maximum element in the stack after each operation. If at some point the stack is empty, the output should be zero.

Input

The input contains several test cases, and the first line is a positive integer T indicating the number of test cases which is up to 50.

To avoid unconcerned time consuming in reading data, each test case is described by seven integers n (1 ≤ n ≤ 5 × 106 ), p, q, m (1 ≤ p, q, m ≤ 109 ), SA, SB and SC (104 ≤ SA, SB, SC ≤ 106 ). The integer n is the number of operations, and your program should generate all operations using the following code in C++.

int n, p, q, m;
unsigned int SA, SB, SC;
unsigned int rng61()
{
    SA ^= SA << 16;
    SA ^= SA >> 5;
    SA ^= SA << 1;
    unsigned int t = SA;
    SA = SB;
    SB = SC;
    SC ^= t ^ SA;
    return SC;
}
void gen()
{
    scanf("%d%d%d%d%u%u%u", &n, &p, &q, &m, &SA, &SB, &SC);
    for(int i = 1; i <= n; i++)
    {
        if(rng61() % (p + q) < p)
            PUSH(rng61() % m + 1);
        else
            POP();
    }
}

The procedure PUSH(v) used in the code inserts a new element with value v into the stack and the procedure POP() pops the topmost element in the stack or does nothing if the stack is empty.

Output

For each test case, output a line containing Case #x: y, where x is the test case number starting from 1, and y is equal to n ⊕ i=1 (i · ai) where ai is the answer after the i-th operation and ⊕ means bitwise xor.

Sample

2

4 1 1 4 23333 66666 233333

4 2 1 4 23333 66666 233333

Case #1: 19

Case #2: 1

Hint

The first test case in the sample input has 4 operations:

• POP();

• POP();

• PUSH(1);

• PUSH(4).

The second test case also has 4 operations:

• PUSH(2);

• POP();

• PUSH(1);

• POP()

题意：栈的维护，两种操作，一种是PUSH（）一个元素，一种是POP（）一个最大的 元素，求每次操作后栈中最大元素与当前操作次数的乘机的异或和。

思路：开一个数组，数组里保存当前所有数的最大值，满足PUSH（）的条件就将此数存入到数组里，并与前面最大的比较大小，所以就将最大元素保存在数组下标最大的那个，满足POP（）的条件就删除数组中最大的数，即最大下标减一，当数组中没有元素即最大下标为0时，下标还是0；

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, p, q, m;
unsigned int SA, SB, SC;
ll s[5000010];
ll ans;
unsigned int rng61()
{
    SA ^= SA << 16;
    SA ^= SA >> 5;
    SA ^= SA << 1;
    unsigned int t = SA;
    SA = SB;
    SB = SC;
    SC ^= t ^ SA;
    return SC;
}
int main()
{
    int t;
    scanf("%d",&t);
    int k=0;
    while(t--)
    {
        k++;
        scanf("%d%d%d%d%u%u%u", &n, &p, &q, &m, &SA, &SB, &SC);
        ll ans=0;
        int top=0;
 
        for(int i = 1; i <= n; i++)
        {
            if(rng61() % (p + q) < p)
            {
                //PUSH(rng61() % m + 1);
                ll res=rng61()%m+1;
                s[++top]=res;
                s[top]=max(s[top],s[top-1]);
            }
 
            else
            {
                // POP();
                top=max(top-1,0);
            }
 
            ans^=(s[top]*1LL*i);
        }
 
        printf("Case #%d: ",k);
        printf("%lld\n",ans);
 
    }
 
 
    return 0;
}