OUC_Summer Training_ DIV2_#4之数据结构

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=26100#problem/A

A - A

Time Limit:1000MS     Memory Limit:30000KB     64bit IO Format:%I64d & %I64u

Submit Status Practice POJ 1936

Description

You have devised a new encryption technique which encodes a message by inserting between its characters randomly generated strings in a clever way. Because of pending patent issues we will not discuss in detail how the strings are generated and inserted into the original message. To validate your method, however, it is necessary to write a program that checks if the message is really encoded in the final string. 

Given two strings s and t, you have to decide whether s is a subsequence of t, i.e. if you can remove characters from t such that the concatenation of the remaining characters is s. 

Input

The input contains several testcases. Each is specified by two strings s, t of alphanumeric ASCII characters separated by whitespace.The length of s and t will no more than 100000.

Output

For each test case output "Yes", if s is a subsequence of t,otherwise output "No".

Sample Input

sequence subsequence
person compression
VERDI vivaVittorioEmanueleReDiItalia
caseDoesMatter CaseDoesMatter

Sample Output

Yes
No
Yes
No

 

//是很简单的题啦  但是我数组开的有点小 总是runtime error
#include<stdio.h>
#include<string.h>
char a[100010];
char b[100010];
int main()
{
    int i,j,na,nb,t = 0,m = 0;
    char c;
    while(scanf("%s",a) != EOF)
    {
        scanf("%s",b);
        na = strlen(a);
        nb = strlen(b);
        for(i = 0;i < na;i++)
        {
            for(j = t;j < nb;j++)
            {
                if(a[i] == b[j])
                {
                    m++;
                    t = j + 1;
                    break;
                }
            }
        }
        if(m == na )printf("Yes
");
        else printf("No
");
        m = 0;
        t = 0;
    }
    return 0;
}

B - B

Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u

Submit Status Practice POJ 1068

Description

Let S = s1 s2...s2n be a well-formed string of parentheses. S can be encoded in two different ways: 
q By an integer sequence P = p1 p2...pn where pi is the number of left parentheses before the ith right parenthesis in S (P-sequence). 
q By an integer sequence W = w1 w2...wn where for each right parenthesis, say a in S, we associate an integer which is the number of right parentheses counting from the matched left parenthesis of a up to a. (W-sequence). 

Following is an example of the above encodings: 

	S		(((()()())))

	P-sequence	    4 5 6666

	W-sequence	    1 1 1456

Write a program to convert P-sequence of a well-formed string to the W-sequence of the same string. 

Input

The first line of the input contains a single integer t (1 <= t <= 10), the number of test cases, followed by the input data for each test case. The first line of each test case is an integer n (1 <= n <= 20), and the second line is the P-sequence of a well-formed string. It contains n positive integers, separated with blanks, representing the P-sequence.

Output

The output file consists of exactly t lines corresponding to test cases. For each test case, the output line should contain n integers describing the W-sequence of the string corresponding to its given P-sequence.

Sample Input

2
6
4 5 6 6 6 6
9 
4 6 6 6 6 8 9 9 9

Sample Output

1 1 1 4 5 6
1 1 2 4 5 1 1 3 9

 

//先把括号的情况还原，在用递归的方法给括号配对，递归不是很熟练，虽然很简单，写了好几遍才对。
#include<stdio.h>
char y[10000];    
int w[50],n,l,j;
int f()
{
    int s=1;
    while(1)
        if(y[j]=='(')
        {
            j++;
            s+=f();
        }
        else
        {
            w[l++]=s;
            j++;
            return s;
        }
}
int main()
{
    int N,i,k,m;
    scanf("%d",&N);
    while(N--)
    {
        scanf("%d",&n);
        for(i=0,l=0,k=0;i<n;i++)
        {
            scanf("%d",&m);
            for(j=0;j<m-k;j++)
                y[l++]='(';
            y[l++]=')';
            k=m;
        }
        l=j=0;
        f();
        for(i=0;i<n;i++)
            printf("%d ",w[i]);
        printf("
");
    }
    return 0;
}