2012年8月9日
POJ 1068 Parencodings ---YY题
摘要： Language:ParencodingsTime Limit:1000MSMemory Limit:10000KTotal Submissions:15029Accepted:8959DescriptionLet 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 阅读全文
posted @ 2012-08-09 12:44 Felix_F 阅读(181) 评论(0) 推荐(0)
POJ 2586 Y2K Accounting Bug 贪心
摘要： #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; int main() { // freopen("in.txt","r",stdin); int a,b; while(cin>>a>>b) { int i,j; b=-b; int x[ 阅读全文
posted @ 2012-08-09 09:04 Felix_F 阅读(111) 评论(0) 推荐(0)
POJ 2029 Get Many Persimmon Trees 简单搜索----解题报告
摘要： 题目很简单...给你N个星星的坐标...找出在m*n的方框中最多能容纳几个星星...直接遍历一遍整个图...属于简单搜索~#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; int map[501][501]; ... 阅读全文
posted @ 2012-08-09 02:34 Felix_F 阅读(130) 评论(0) 推荐(0)