hdoj 1361 Parencodings 2001 Asia Regional Teheran

思路：模拟，根据序列P可以构造出S，然后再根据S，推出序列W。

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>using namespace std;char str[50];
int w[25];int main()
{int t, n, num;scanf("%d", &t);while (t--) {scanf("%d", &n);int i ,j = 0, cnt = 0;for (i = 0; i < n; ++i) {scanf("%d", &num);for (; j < num; ++j)str[cnt++] = '(';str[cnt++] = ')';}n *= 2;int lf, rt;cnt = 0;for(i = 0; i < n; ++i) {if (str[i] == '(')continue;lf = 0;rt = 1;j = i - 1;while (1) {if (str[j] == ')')rt++;elself++;if(rt == lf) {w[cnt++] = rt;break;}j--;}}for (i = 0; i < cnt-1; ++i)printf("%d ", w[i]);printf("%d\n", w[cnt-1]);}return 0;
}

hdoj 1361 Parencodings 2001 Asia Regional Teheran相关推荐

HDU/HDOJ 2446 Shell Pyramid 2008 Asia Regional Harbin
Shell Pyramid Time Limit : 5000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other) Total ...
2015 ACM/ICPC Asia Regional Shenyang Online题解
以下所有AC题解程序来自"仙客传奇"团队. AC题数:7/13 ABCFGJL A. Traversal AC的C++语言程序: #include <bits/stdc++. ...
Problem 1002-2017 ACM/ICPC Asia Regional Shenyang Online
网络赛:2017 ACM/ICPC Asia Regional Shenyang Online 题目来源:cable cable cable Problem Description: Connecti ...
2017 ACM ICPC Asia Regional - Daejeon
2017 ACM ICPC Asia Regional - Daejeon Problem A Broadcast Stations 题目描述:给出一棵树,每一个点有一个辐射距离$p_i$(待确定 ...
2014 ACM/ICPC Asia Regional Guangzhou Online C题Wang Xifeng's Little Plot(dfs)
Wang Xifeng's Little Plot Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Jav ...
训练赛Day6-The 36th ACMICPC Asia Regional Beijing Site
训练赛Day6-The 36th ACM/ICPC Asia Regional Beijing Site B - Eliminate Witches! 题目大意 [样例解释] 给你一个字符串: wal ...
The 36th ACM/ICPC Asia Regional Dalian Site 1006 Dave
Dave Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65768/65768K (Java/Other) Total Submissi ...
[Contest]2017 ACM/ICPC Asia Regional Shenyang Online（01 03 07 09 10 11待补）
1001 string string string 题意给定一个字符串$s$,求其中出现$k$次的子串的个数. 题解后缀自动机. 代码 1002 cable cable cable 题意给定$M ...
hdu 1361 Parencodings 简单模拟
Parencodings 题意: 由括号序列S可经P规则和W规则变形为P序列和W序列. p规则是:pi是第i个右括号左边的左括号的数: w规则是:wi是第i右括号与它匹配的左括号之间右括号的数(其中包 ...
2013 ACM/ICPC Asia Regional Chengdu Online We Love MOE Girls 字符串STL 的应用
题目来源: http://acm.hdu.edu.cn/showproblem.php?pid=4730 分析1:string s.substr(pos, n) 从 pos 开始截取n个字符代码 ...

hdoj 1361 Parencodings 2001 Asia Regional Teheran

hdoj 1361 Parencodings 2001 Asia Regional Teheran相关推荐

最新文章

热门文章