11 2015 档案

摘要:Finding NemoTime Limit:2000MSMemory Limit:30000KTotal Submissions:8456Accepted:1975DescriptionNemo is a naughty boy. One day he went into the deep sea... 阅读全文
posted @ 2015-11-30 23:35 zhaop 阅读(342) 评论(0) 推荐(0) 编辑
摘要:棋盘游戏Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3372Accepted Submission(s): 1997Problem Descri... 阅读全文
posted @ 2015-11-29 19:58 zhaop 阅读(231) 评论(0) 推荐(0) 编辑
摘要:今天中午在东北大学网站上参加了第三届图灵杯的比赛,出了4题,排名45,与一些大牛们还是差太多,其中有三个还都AK了。题目还是有很大的水分,第一题直接就是让输出一个字符串,比A+B 还水,自己思维还是不行,不能想到高效的方法,这场比赛的题目就我而言还是比较好的,太多需要优化的,我抽空一定得把一些能做的... 阅读全文
posted @ 2015-11-28 23:31 zhaop 阅读(161) 评论(0) 推荐(0) 编辑
摘要:Antenna PlacementTime Limit:1000MSMemory Limit:65536KTotal Submissions:7788Accepted:3880DescriptionThe Global Aerial Research Centre has been allotted... 阅读全文
posted @ 2015-11-27 17:09 zhaop 阅读(212) 评论(0) 推荐(0) 编辑
摘要:AsteroidsTime Limit:1000MSMemory Limit:65536KTotal Submissions:18289Accepted:9968DescriptionBessie wants to navigate her spaceship through a dangerous... 阅读全文
posted @ 2015-11-26 21:14 zhaop 阅读(184) 评论(0) 推荐(0) 编辑
摘要:E -ArbitrageTime Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 2240Appoint description:DescriptionArbitrage is ... 阅读全文
posted @ 2015-11-26 16:13 zhaop 阅读(155) 评论(0) 推荐(0) 编辑
摘要:Currency ExchangeTime Limit:1000MSMemory Limit:30000KTotal Submissions:23938Accepted:8678DescriptionSeveral currency exchange points are working in ou... 阅读全文
posted @ 2015-11-25 21:20 zhaop 阅读(179) 评论(0) 推荐(0) 编辑
摘要:WormholesTime Limit:2000MSMemory Limit:65536KTotal Submissions:38300Accepted:14095DescriptionWhile exploring his many farms, Farmer John has discovere... 阅读全文
posted @ 2015-11-25 14:58 zhaop 阅读(190) 评论(0) 推荐(0) 编辑
摘要:Til the Cows Come Home Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 37662 Accepted: 12836 Description Bessie is out in the field and wan 阅读全文
posted @ 2015-11-24 20:13 zhaop 阅读(209) 评论(0) 推荐(0) 编辑
摘要:Minimum Transport CostTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9109Accepted Submission(s): ... 阅读全文
posted @ 2015-11-23 23:14 zhaop 阅读(247) 评论(0) 推荐(0) 编辑
摘要:The Unique MSTTime Limit:1000MSMemory Limit:10000KTotal Submissions:25203Accepted:8995DescriptionGiven a connected undirected graph, tell if its minim... 阅读全文
posted @ 2015-11-22 17:00 zhaop 阅读(182) 评论(0) 推荐(0) 编辑
摘要:Truck HistoryTime Limit:2000MSMemory Limit:65536KTotal Submissions:22648Accepted:8781DescriptionAdvanced Cargo Movement, Ltd. uses trucks of different... 阅读全文
posted @ 2015-11-22 10:39 zhaop 阅读(203) 评论(0) 推荐(0) 编辑
摘要:BSTTime Limit:1000MSMemory Limit:65536KTotal Submissions:9182Accepted:5613DescriptionConsider an infinite full binary search tree (see the figure belo... 阅读全文
posted @ 2015-11-21 21:27 zhaop 阅读(245) 评论(0) 推荐(0) 编辑
摘要:树状数组求逆序对转载http://www.cnblogs.com/shenshuyang/archive/2012/07/14/2591859.html转载:树状数组,具体的说是 离散化+树状数组。这也是学习树状数组的第一题.算法的大体流程就是:1.先对输入的数组离散化,使得各个元素比较接近,而不是... 阅读全文
posted @ 2015-11-21 15:42 zhaop 阅读(208) 评论(0) 推荐(0) 编辑
摘要:Network SaboteurTime Limit:2000MSMemory Limit:65536KTotal Submissions:10391Accepted:4990DescriptionA university network is composed of N computers. Sy... 阅读全文
posted @ 2015-11-20 19:06 zhaop 阅读(170) 评论(0) 推荐(0) 编辑
摘要:Ctime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter making bad dives into swimming pools, Wilb... 阅读全文
posted @ 2015-11-20 15:36 zhaop 阅读(194) 评论(0) 推荐(0) 编辑
摘要:HighwaysTime Limit:1000MSMemory Limit:65536KTotal Submissions:26516Accepted:12136DescriptionThe island nation of Flatopia is perfectly flat. Unfortuna... 阅读全文
posted @ 2015-11-19 17:11 zhaop 阅读(216) 评论(0) 推荐(0) 编辑
摘要:Agri-NetTime Limit:1000MSMemory Limit:10000KTotal Submissions:46811Accepted:19335DescriptionFarmer John has been elected mayor of his town! One of his... 阅读全文
posted @ 2015-11-19 16:25 zhaop 阅读(191) 评论(0) 推荐(0) 编辑
摘要:CowsTime Limit:3000MSMemory Limit:65536KTotal Submissions:15222Accepted:5070DescriptionFarmer John's cows have discovered that the clover growing alon... 阅读全文
posted @ 2015-11-19 15:13 zhaop 阅读(259) 评论(0) 推荐(0) 编辑
摘要:MatrixTime Limit:3000MSMemory Limit:65536KTotal Submissions:22058Accepted:8219DescriptionGiven an N*N matrix A, whose elements are either 0 or 1. A[i,... 阅读全文
posted @ 2015-11-17 20:57 zhaop 阅读(244) 评论(0) 推荐(0) 编辑
摘要:终端窗口快捷键 复制:Ctrl + Shift + c 粘贴:Ctrl + Shift + v 如果在终端外层窗口复制内容,粘贴在终端:Shift + insert 查看U盘信息: sudo fdisk -l 文件指令 ls: ls -a :把隐藏的文件显示 ls -l 显示文件的详细信息 -lh 阅读全文
posted @ 2015-11-16 22:59 zhaop 阅读(299) 评论(0) 推荐(0) 编辑
摘要:Color the ballTime Limit: 9000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13645Accepted Submission(s): 6850Pro... 阅读全文
posted @ 2015-11-15 20:23 zhaop 阅读(178) 评论(0) 推荐(0) 编辑

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