随笔分类 -  poj

Poj The xor-longest Path 经典题 Trie求n个数中任意两个异或最大值
摘要：Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 5646 Accepted: 1226 Description In an edge-weighted tree, the xor-length of a path p is def 阅读全文
posted @ 2016-05-19 09:25 JL_Zhou 阅读(4699) 评论(0) 推荐(0) 编辑
POJ1201 Intervals差分约束系统（最短路）
摘要：Description Input Output Sample Input Sample Output Source 阅读全文
posted @ 2016-03-17 22:45 JL_Zhou 阅读(351) 评论(0) 推荐(0) 编辑
poj 2774 Long Long Message 后缀数组基础题
摘要：Time Limit:4000MSMemory Limit:131072KTotal Submissions:24756Accepted:10130Case Time Limit:1000MSDescriptionThe little cat is majoring in physics in th... 阅读全文
posted @ 2015-12-29 15:15 JL_Zhou 阅读(225) 评论(0) 推荐(0) 编辑
滑雪（简单dp）
摘要：Time Limit:1000MSMemory Limit:65536KTotal Submissions:81099Accepted:30239DescriptionMichael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上... 阅读全文
posted @ 2015-04-24 19:35 JL_Zhou 阅读(183) 评论(0) 推荐(0) 编辑
The Unique MST（次小生成树）
摘要：Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 22335Accepted: 7922DescriptionGiven a connected undirected graph, tell if its minimum spannin... 阅读全文
posted @ 2015-04-18 22:40 JL_Zhou 阅读(191) 评论(0) 推荐(0) 编辑
Lost Cows
摘要：Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 9669Accepted: 6228DescriptionN (2 #include#include#include#includeusing namespace std;const i... 阅读全文
posted @ 2015-04-12 08:34 JL_Zhou 阅读(203) 评论(0) 推荐(0) 编辑
A - The Moronic Cowmpouter
摘要：Description Inexperienced in the digital arts, the cows tried to build a calculating engine (yes, it's a cowmpouter) using binary numbers (base 2) but... 阅读全文
posted @ 2015-04-05 10:14 JL_Zhou 阅读(263) 评论(0) 推荐(0) 编辑
迷宫问题
摘要：Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 9311Accepted: 5514Description定义一个二维数组： int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0,... 阅读全文
posted @ 2015-03-24 16:15 JL_Zhou 阅读(133) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示