逆风的方向 更适合飞翔

http://hihocoder.com/contest/challenge7/problem/1描述给定一个字符串，判断其是否为合法的正则表达式。 一个正则表达式定义为： 1：0是正则表达式，1也是正则表达式。 2：P和Q都是正则表达式，则PQ是正则表达式。 3：P是正则表达式，则(P)是正则表达式 4：P是正则表达式，则P*也是正则表达式 5：P和Q都是

http://acm.csu.edu.cn/OnlineJudge/problem.php?id=1555输入5个数1 2 0 1 0 表示1前面有1个比它大的数，2前面有2个比它大的数…..求一个1~n的排列，比如这个就输出3 1 5 2 41前面有1个比它大的数，那么1肯定在第二位2前面有2个比它大的数，那么2肯定排在第四位，有一位被1占了。3前面有0个比它大的数，

http://acm.csu.edu.cn/OnlineJudge/problem.php?id=1548第一次接触三分，题意和代码参考的网上的。题意：修路：从(0,0)~(x,y)，n个数表示有第二行开始有n行表示有n条河，tx是河的起始位置，ty是河的宽度，有水的地方要修桥，而x，y表示修路的端点，C1表示修路每米的花费，C2表示修桥每米的花费，问你最后花费的最少金额！思路：先把有

题目地址：http://acm.csu.edu.cn/OnlineJudge/problem.php?id=1553给定n的数的序列，求最长连续区间满足区间内的数最大值与最小值的差(尺取法)const int maxn=10010;int num[maxn];int n,k;int MIN,MAX;int main(){ while(scanf("%d%d",&n,&

Little Zu Chongzhi's TrianglesProblem DescriptionZu Chongzhi (429–500) was a prominent Chinese mathematician and astronomer during the Liu Song and Southern Qi Dynasties. Zu calculated the

Sequence IIProblem DescriptionLong long ago, there is a sequence A with length n. All numbers in this sequence is no smaller than 1 and no bigger than n, and all numbers are different in

FormulaProblem Descriptionf(n)=(∏i=1nin−i+1)%1000000007You are expected to write a program to calculate f(n) when a certain n is given. InputMulti test cases (about 10000

A. Giga Towertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputGiga Tower is the tallest and deepest building

Revenge of Segment TreeProblem DescriptionIn computer science, a segment tree is a tree data structure for storing intervals, or segments. It allows querying which of the stored segments c

Wang Xifeng's Little PlotProblem Description《Dream of the Red Chamber》(also 《The Story of the Stone》) is one of the Four Great Classical Novels of Chinese literature, and it is commonly

题目：时间限制:2000ms单点时限:1000ms内存限制:256MB描述小Ho给自己定了一个宏伟的目标：连续100天每天坚持在hihoCoder上提交一个程序。100天过去了，小Ho查看自己的提交记录发现有N天因为贪玩忘记提交了。于是小Ho软磨硬泡、强忍着小Hi鄙视的眼神从小Hi那里要来M张"补提交卡"。每张"补提交卡"都可以补回一天的提交，将

StringProblem DescriptionYou hava a non-empty string which consists of lowercase English letters and may contain at most one '?'. Let's choose non-empty substring G from S (it can be G = S

MazeSpecial JudgeProblem DescriptionWhen wake up, lxhgww find himself in a huge maze.The maze consisted by N rooms and tunnels connecting these rooms. Each pair of rooms is connected b

One Person GameTime Limit: 1 Second      Memory Limit: 32768 KB      Special JudgeThere is a very simple and interesting one-person game. You have 3 dice, namely Die1, Die2 and Die3. Die1 ha

Matrix MultiplicationTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 16118 Accepted: 3485DescriptionYou are given three n × n matrices A, B and C. Doe

SubsequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8403 Accepted: 3264DescriptionA sequence of N positive integers (10 < N < 100 000), each of

Feel GoodTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 9186 Accepted: 2509Case Time Limit: 1000MS Special JudgeDescriptionBill is developi