上一页 1 2 3 4 5 6 7 ··· 12 下一页
摘要: 已经很久没有写博客了,好像写博客这件事并不能坚持下来一样。 从暑假的8月至今,这两个月的时间里面状态可以说是持续下降,从前面的多校到之后的网络赛,可以说是一场不如一场,打的越来越差。再加上外界的一些压力,期间也在不停的反思和纠结,但是一直找不到问题出在哪里。现在写这篇博文的时候其实依旧不太清楚... 阅读全文
posted @ 2015-09-25 01:24 WhyWhy。 阅读(1370) 评论(0) 推荐(0) 编辑
摘要: 主席树(Chair Tree),一个神奇的数据结构。 实质上是函数式的线段树,或者可持久化的线段树。可持久化这个还比较好理解,Persistent Data Structures,看一下以上这篇文章就差不多明白为啥叫可持久化的的了。但是恕我太弱,对函数式编程实在理解不了多少,所以为啥是函数式的... 阅读全文
posted @ 2015-07-29 20:36 WhyWhy。 阅读(359) 评论(0) 推荐(0) 编辑
摘要: Problem DescriptionCoco has a tree, whose vertices are conveniently labeled by 1,2,…,n.There are m chain on the tree, Each chain has a certain weight.... 阅读全文
posted @ 2015-07-22 19:33 WhyWhy。 阅读(396) 评论(0) 推荐(0) 编辑
摘要: DescriptionFarmer John has purchased a lush new rectangular pasture composed ofMbyN(1 ≤M≤ 12; 1 ≤N≤ 12) square parcels. He wants to grow some yummy co... 阅读全文
posted @ 2015-07-21 10:18 WhyWhy。 阅读(204) 评论(0) 推荐(0) 编辑
摘要: DescriptionWhile visiting a traveling fun fair you suddenly have an urge to break the high score in the Whac-a-Mole game. The goal of the Whac-a-Mole ... 阅读全文
posted @ 2015-07-21 10:15 WhyWhy。 阅读(195) 评论(0) 推荐(0) 编辑
摘要: DescriptionThe NASA Space Center, Houston, is less than 200 miles from San Antonio, Texas (the site of the ACM Finals this year). This is the place wh... 阅读全文
posted @ 2015-07-20 10:55 WhyWhy。 阅读(238) 评论(0) 推荐(0) 编辑
摘要: DescriptionSeiji Hayashi had been a professor of the Nisshinkan Samurai School in the domain of Aizu for a long time in the 18th century. In order to ... 阅读全文
posted @ 2015-07-20 10:10 WhyWhy。 阅读(188) 评论(0) 推荐(0) 编辑
摘要: DescriptionIn Korea, the naughtiness of the cheonggaeguri, a small frog, is legendary. This is a well-deserved reputation, because the frogs jump thro... 阅读全文
posted @ 2015-07-20 09:39 WhyWhy。 阅读(264) 评论(0) 推荐(0) 编辑
摘要: DescriptionKeeping track of all the cows can be a tricky task so Farmer John has installed a system to automate it. He has installed on each cow an el... 阅读全文
posted @ 2015-07-20 09:35 WhyWhy。 阅读(161) 评论(0) 推荐(0) 编辑
摘要: Description将一个8*8的棋盘进行如下分割:将原棋盘割下一块矩形棋盘并使剩下部分也是矩形,再将剩下的部分继续如此分割,这样割了(n-1)次后,连同最后剩下的矩形棋盘共有n块矩形棋盘。(每次切割都只能沿着棋盘格子的边进行)原棋盘上每一格有一个分值,一块矩形棋盘的总分为其所含各格分值之和。现在... 阅读全文
posted @ 2015-07-20 09:30 WhyWhy。 阅读(211) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 ··· 12 下一页