随笔分类 -  ACM-POJ

poj 3050 Hopscotch（暴力+dfs）
摘要：Description The cows play the child's game of hopscotch in a non-traditional way. Instead of a linear set of numbered boxes into which to hop, the cow 阅读全文
posted @ 2016-12-22 21:10 Wally的博客 阅读(237) 评论(0) 推荐(0)
poj 3187 Backward Digit Sums（暴力）
摘要：Description FJ and his cows enjoy playing a mental game. They write down the numbers from 1 to N (1 <= N <= 10) in a certain order and then sum adjace 阅读全文
posted @ 2016-12-22 21:01 Wally的博客 阅读(160) 评论(0) 推荐(0)
poj 2718 Smallest Difference（暴力）
摘要：Description Given a number of distinct decimal digits, you can form one integer by choosing a non-empty subset of these digits and writing them in som 阅读全文
posted @ 2016-12-22 20:55 Wally的博客 阅读(187) 评论(0) 推荐(0)
poj 1979 Red and Black（dfs）
摘要：There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he c 阅读全文
posted @ 2016-12-22 20:41 Wally的博客 阅读(115) 评论(0) 推荐(0)
manachar算法小结
摘要：1.hdu--4513 吉哥系列故事——完美队形II http://acm.hdu.edu.cn/showproblem.php?pid=4513 题意：中文题不解释 思路：数字型的manachar算法。将模板中的比较字符改为比较数字就行了。 AC代码： 1 #include <iostream> 阅读全文
posted @ 2016-12-01 21:05 Wally的博客 阅读(531) 评论(0) 推荐(0)
poj--3667 Hotel（线段树+区间合并）
摘要：Description The cows are journeying north to Thunder Bay in Canada to gain cultural enrichment and enjoy a vacation on the sunny shores of Lake Superi 阅读全文
posted @ 2016-11-09 21:16 Wally的博客 阅读(235) 评论(0) 推荐(0)
poj--3067 Japan（线段树+单点更新区间查询）
摘要：Description Japan plans to welcome the ACM ICPC World Finals and a lot of roads must be built for the venue. Japan is tall island with N cities on the 阅读全文
posted @ 2016-11-02 14:09 Wally的博客 阅读(157) 评论(0) 推荐(0)
poj--2528 Mayor's posters（线段树+离散化）
摘要：Description The citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral poste 阅读全文
posted @ 2016-10-30 20:45 Wally的博客 阅读(108) 评论(0) 推荐(0)
poj--2823 Sliding Window（优先队列 | | 线段树）
摘要：Description An array of size n ≤ 10 6 is given to you. There is a sliding window of size k which is moving from the very left of the array to the very 阅读全文
posted @ 2016-10-30 20:14 Wally的博客 阅读(98) 评论(0) 推荐(0)
poj--2352 Stars(树状数组）
摘要：Description Astronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the leve 阅读全文
posted @ 2016-10-30 17:13 Wally的博客 阅读(122) 评论(0) 推荐(0)
poj--2299 Ultra-QuickSort（树状数组求逆序数）
摘要：Description In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping 阅读全文
posted @ 2016-10-22 21:57 Wally的博客 阅读(114) 评论(0) 推荐(0)
poj--3264 Balanced Lineup（裸的RMQ）
摘要：Description For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides to organize a g 阅读全文
posted @ 2016-10-22 21:41 Wally的博客 阅读(163) 评论(0) 推荐(0)
POJ--2488 A Knight's Journeyb
摘要：题目链接： http://poj.org/problem?id=2488 注意两点： 1.本题要求按照字典序最小输出所以a[8]={-1, 1, -2, 2, -2, 2, -1, 1},b[8]={-2, -2, -1, -1, 1, 1, 2, 2} 2.由于 1 <= p * q <= 26所 阅读全文
posted @ 2016-08-12 15:52 Wally的博客 阅读(269) 评论(0) 推荐(0)
poj-2386 Lake Counting
摘要：第一个深搜的问题，虽然很简单，但是很高兴，加油！！！ 题目链接： http://poj.org/problem?id=2386 题目交了好几次，一直RE，又重新写了一遍总算是A了 最初RE是由于是s[x][y]='#'放到了dfs的后面，以后要把最初的改变放在前面 RE代码，引以为戒： 1 #inc 阅读全文
posted @ 2016-08-09 19:42 Wally的博客 阅读(140) 评论(0) 推荐(0)