poj
Red_Flame
热爱C/C算法Windwos编程.
展开
-
poj 2352 线段树
链接:http://poj.org/problem?id=2352DescriptionAstronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of a star原创 2012-12-08 02:11:31 · 485 阅读 · 0 评论 -
poj 3461
链接:http://poj.org/problem?id=3461KMP:AC code:#include#include#includeusing namespace std;char p[10005],q[1000005];int nextval[10005];void getnextval(char p[],int m){ int i,j=原创 2013-04-05 21:43:44 · 619 阅读 · 0 评论 -
poj 1521 Entropy
链接:http://poj.org/problem?id=1521DescriptionAn entropy encoder is a data encoding method that achieves lossless data compression by encoding a message with "wasted" or "extra" information remove原创 2013-01-24 15:01:22 · 924 阅读 · 0 评论 -
poj 2406
题目链接:http://poj.org/problem?id=2406DescriptionGiven two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concate原创 2012-12-24 00:50:20 · 549 阅读 · 0 评论 -
nyoj 129 poj 1308 Is a tree
A tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the following properties.Ther原创 2012-11-23 18:45:51 · 516 阅读 · 0 评论 -
poj 3339 nyoj 130 Snowflake Snow Snowflakes
链接:http://poj.org/problem?id=3349 题意:判断是否存在两个完全相同的雪花,雪花相同的条件是按逆时针或顺时针起对应的六条边相等.用一般方法处理肯定超时.引用一段哈原创 2012-12-04 00:43:03 · 862 阅读 · 0 评论 -
poj 2528 Mayor's poster
链接:http://poj.org/problem?id=2528DescriptionThe citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all plac原创 2012-12-06 02:10:55 · 1480 阅读 · 0 评论 -
poj 1700 过河问题
链接:http://poj.org/problem?id=1700 A group of N people wishes to go across a river with only one boat, which can at most carry two persons. Therefore some sort of shuttle arrangement must be arrang原创 2012-12-17 00:33:48 · 644 阅读 · 0 评论 -
poj 1050 nyoj104 矩阵最大和
给定一个由整数组成二维矩阵(r*c),现在需要找出它的一个子矩阵,使得这个子矩阵内的所有元素之和最大,并把这个子矩阵称为最大子矩阵。例子:0 -2 -7 0 9 2 -6 2 -4 1 -4 1 -1 8 0 -2 其最大子矩阵为:9 2 -4 1 -1 8 其元素总和为15。输入 第一行输入一个整数n(0每组测试数据原创 2012-11-09 22:13:26 · 715 阅读 · 0 评论 -
poj 1321
链接:http://poj.org/problem?id=1321DFS问题.AC code#include#include #include using namespace std;int n,k,Maze[9][9],sum,visited[9]; //列标记数组void DFS(int row,int s){ if(s==k) { sum++;return;} i原创 2013-04-09 19:33:51 · 560 阅读 · 0 评论