Chen_yuazzy的博客

题目描述：考虑一种简单的正则表达式： 只由 x ( ) | 组成的正则表达式。  小明想求出这个正则表达式能接受的最长字符串的长度。  例如 ((xx|xxx)x|(x|xx))xx 能接受的最长字符串是： xxxxxx，长度是6输入：  ((xx|xxx)x|(x|xx))xx 程序应该输出： 6思路：遇到 '(' 就递归调用函数， 遇到 'a' 就将计数器x++

Hamming Distance SumDescription Genos needs your help. He was asked to solve the following programming problem by Saitama:The length of some string s is denoted |s|. The Hamming distance between two s

OlympiadDescription You are one of the competitors of the Olympiad in numbers. The problem of this year relates to beatiful numbers. One integer is called beautiful if and only if all of its digitals

EquatorDescription Input Output Sample Input 3 3 1 2 3 8 4 5 -1 -1 1 -1 -1 5 2 -1 -1 Sample Output 6 14 0题意：输入数据：T数据组数 接下来T行，第一个数字n为个数。接下来有n个数（正/负都可能有）。求出这些数字（要保证相邻）最大的和。思路：用前缀和法预处理出数组每个数的前