Codeforces Round #223 (Div. 2)

A. Sereja and Dima

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Sereja and Dima play a game. The rules of the game are very simple. The players have n cards in a row. Each card contains a number, all numbers on the cards are distinct. The players take turns, Sereja moves first. During his turn a player can take one card: either the leftmost card in a row, or the rightmost one. The game ends when there is no more cards. The player who has the maximum sum of numbers on his cards by the end of the game, wins.

Sereja and Dima are being greedy. Each of them chooses the card with the larger number during his move.

Inna is a friend of Sereja and Dima. She knows which strategy the guys are using, so she wants to determine the final score, given the initial state of the game. Help her.

Input

The first line contains integer n (1 ≤ n ≤ 1000) — the number of cards on the table. The second line contains space-separated numbers on the cards from left to right. The numbers on the cards are distinct integers from 1 to 1000.

Output

On a single line, print two integers. The first number is the number of Sereja's points at the end of the game, the second number is the number of Dima's points at the end of the game.

Sample test(s)

input

4
4 1 2 10

output

12 5

input

7
1 2 3 4 5 6 7

output

16 12

Note

In the first sample Sereja will take cards with numbers 10 and 2, so Sereja's sum is 12. Dima will take cards with numbers 4 and 1, so Dima's sum is 5.

题意：2个人轮流在一个数列取数，每轮都取第一个和最后一个比较大的数，问最后2个人的数的和

题解：直接用个数组模拟一下就行了

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
int a[1008],dp[100000][100000];
int main()
{
    int i,n,l,r,di,se;

    while(scanf("%d",&n)>0)
    {
        di=se=0;
        for(i=0;i<n;i++) scanf("%d",a+i);
        l=0,r=n-1;
        for(i=0;i<n;i++)
        {
            if(a[l]>a[r])
            {
                if(i&1) di+=a[l++];
                else se+=a[l++];
            }
            else
            {
                if(i&1) di+=a[r--];
                else se+=a[r--];
            }
        }
        printf("%d %d\n",se,di);
    }

    return 0;
}

B. Sereja and Stairs

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Sereja loves integer sequences very much. He especially likes stairs.

Sequence a₁, a₂, ..., a_|a| (|a| is the length of the sequence) is stairs if there is such index i (1 ≤ i ≤ |a|), that the following condition is met:

a₁ < a₂ < ... < a_i - 1 < a_i > a_i + 1 > ... > a_|a| - 1 > a_|a|.

For example, sequences [1, 2, 3, 2] and [4, 2] are stairs and sequence [3, 1, 2] isn't.

Sereja has m cards with numbers. He wants to put some cards on the table in a row to get a stair sequence. What maximum number of cards can he put on the table?

Input

The first line contains integer m (1 ≤ m ≤ 10⁵) — the number of Sereja's cards. The second line contains m integers b_i (1 ≤ b_i ≤ 5000)— the numbers on the Sereja's cards.

Output

In the first line print the number of cards you can put on the table. In the second line print the resulting stairs.

Sample test(s)

input

5
1 2 3 4 5

output

5
5 4 3 2 1

input

6
1 1 2 2 3 3

output

5
1 2 3 2 1

题意：给n个数，取一些出来，排成先严格递增再严格递减的序列

题解：把n个数升序排序，顺着扫一遍，若比上一个取出来的数大就取出来并标记，再倒着扫一遍，若比上一个取出来的数小就取出来，然后输出就行了

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<algorithm>
using namespace std;
int a[100008],flag[100008],b[100008];
int main()
{
    int i,n,last,all;

    while(scanf("%d",&n)>0)
    {
        for(all=i=0;i<n;i++)
        {
            scanf("%d",a+i);
            flag[i]=1;
        }
        sort(a,a+n);
        b[all++]=a[0];
        last=flag[0]=0;
        for(i=1;i<n;i++)
        {
            if(a[i]>a[last])
            {
                b[all++]=a[i];
                last=i;
                flag[i]=0;
            }
        }
        for(i=n-1;i>=0;i--)
        {
            if(flag[i]&&a[i]<a[last])
            {
                b[all++]=a[i];
                last=i;
            }
        }
        printf("%d\n",all);
        for(i=0;i<all;i++)
        {
            printf("%d",b[i]);
            if(i==all-1) printf("\n");
            else printf(" ");
        }
    }

    return 0;
}

C. Sereja and Prefixes

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Sereja loves number sequences very much. That's why he decided to make himself a new one following a certain algorithm.

Sereja takes a blank piece of paper. Then he starts writing out the sequence in m stages. Each time he either adds a new number to the end of the sequence or takes l first elements of the current sequence and adds them c times to the end. More formally, if we represent the current sequence as a₁, a₂, ..., a_n, then after we apply the described operation, the sequence transforms intoa₁, a₂, ..., a_n[, a₁, a₂, ..., a_l] (the block in the square brackets must be repeated c times).

A day has passed and Sereja has completed the sequence. He wonders what are the values of some of its elements. Help Sereja.

Input

The first line contains integer m (1 ≤ m ≤ 10⁵) — the number of stages to build a sequence.

Next m lines contain the description of the stages in the order they follow. The first number in the line is a type of stage (1 or 2). Type 1 means adding one number to the end of the sequence, in this case the line contains integer x_i (1 ≤ x_i ≤ 10⁵) — the number to add. Type 2 means copying a prefix of length l_i to the end c_i times, in this case the line further contains two integers l_i, c_i (1 ≤ l_i ≤ 10⁵, 1 ≤ c_i ≤ 10⁴),l_i is the length of the prefix, c_i is the number of copyings. It is guaranteed that the length of prefix l_i is never larger than the current length of the sequence.

The next line contains integer n (1 ≤ n ≤ 10⁵) — the number of elements Sereja is interested in. The next line contains the numbers of elements of the final sequence Sereja is interested in. The numbers are given in the strictly increasing order. It is guaranteed that all numbers are strictly larger than zero and do not exceed the length of the resulting sequence. Consider the elements of the final sequence numbered starting from 1 from the beginning to the end of the sequence.

Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64dspecifier.

Output

Print the elements that Sereja is interested in, in the order in which their numbers occur in the input.

Sample test(s)

input

6
1 1
1 2
2 2 1
1 3
2 5 2
1 4
16
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

output

1 2 1 2 3 1 2 1 2 3 1 2 1 2 3 4

题意：给定m次操作，操作有1，2。1的话代表把x加入序列末，2代表把序列前缀长度为l，复制c遍加到末尾，然后输入n个数，输出n个数下标对应的数字。

题解：考虑到每次复制都只需取前l个数，而l小于10^5，所以先把前10^5个数打出来，然后在m个操作上面逐个模拟，若要查找的数是这个操作制造出来的，若是1的话，直接输出，若是2的话，就mod l 然后就是刚才打印的那10^5的数组相应的数了

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#define MAX 1000000
struct point{
    int sta,l,c,x;
}p[MAX+8];
long long a[MAX+8];
int save[MAX+8];
int main()
{
    int i,j,k,n,m,all;
    long long now,id,temp;

    while(scanf("%d",&m)>0)
    {
        for(i=0;i<m;i++)
        {
            scanf("%d",&p[i].sta);
            if(p[i].sta==1) scanf("%d",&p[i].x);
            else scanf("%d%d",&p[i].l,&p[i].c);
        }
        scanf("%d",&n);
        for(i=0;i<n;i++) scanf("%I64d",a+i);
        for(all=i=0;i<m&&all<MAX;i++)
        {
            if(p[i].sta==1) save[all++]=p[i].x;
            else
            {
                for(j=0;j<p[i].c&&all<MAX;j++)
                {
                    for(k=0;k<p[i].l&&all<MAX;k++)
                        save[all++]=save[k];
                }
            }
        }

        i=now=id=0;
        while(i<n)
        {
            if(p[now].sta==1)
            {
                id++;
                if(a[i]==id)
                {
                    printf("%d",p[now].x);
                    i++;
                    if(i!=n) printf(" ");
                    else{ printf("\n"); break; }
                }
            }
            else
            {
                temp=id+p[now].l*p[now].c;
                while(i<n&&a[i]<=temp)
                {
                    printf("%d",save[(a[i]-id-1)%p[now].l]);
                    i++;
                    if(i!=n) printf(" ");
                    else{ printf("\n"); break; }
                }
                id=temp;
            }
            now++;
        }
    }

    return 0;
}