ZOJ 1016 Parencodings

Parencodings

题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=16

比较简单，直接在该位置往前找，找到能匹配的，越过的右括号+1即为所求答案。

//Problem Name:Parencodings
//Source: ZOJ
//Author: jinjin18
//Main idea:
//Language: C++
//======================================================================

#include<stdio.h>
#include<vector>

using namespace std;

vector<int> p;
vector<int> w;
int main(){
    int n;
    scanf("%d",&n);
    while(n--){
        p.clear();          //remember to initialize
        w.clear();
        int m;
        scanf("%d",&m);
        for(int i = 0; i < m ; i++){
            int x;
            scanf("%d",&x);
            p.push_back(x);
        }
        w.push_back(1);
        printf("%d",w[0]);
        for(int i = 1; i < m ; i++){
            int j = i - 1;
            while(p[i]-p[j] - (i-j) < 0&&j >= 0){
                j--;
            }
            w.push_back(i-j);

            printf(" %d",w[i]);
        }
        printf("
");

    }
    return 0;
}