<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[不念过往 , 不愧恒心]]></title><description><![CDATA[孤独 , 是痛苦的 ; 然而 , 不孤独 , 却更带来更大的痛苦 ... ...]]></description><link>https://blog.youkuaiyun.com/Trapper_C</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Trapper_C]]></copyright><item><title><![CDATA[nyoj 47 过河问题  贪心]]></title><link>https://blog.youkuaiyun.com/Trapper_C/article/details/52549563</link><guid>https://blog.youkuaiyun.com/Trapper_C/article/details/52549563</guid><author>Trapper_C</author><pubDate>Thu, 15 Sep 2016 13:41:38 +0800</pubDate><description><![CDATA[过河问题, 原文链接, click here .时间限制：1000 ms  |  内存限制：65535 KB 
难度：5描述 
在漆黑的夜里，N位旅行者来到了一座狭窄而且没有护栏的桥边。如果不借助手电筒的话，大家是无论如何也不敢过桥去的。不幸的是，N个人一共只带了一只手电筒，而桥窄得只够让两个人同时过。如果各自单独过桥的话，N人所需要的时间已知；而如果两人同时过桥，所需要的时间就是走得比较慢的那个人]]></description><category></category></item><item><title><![CDATA[nyoj 305  表达式求值   栈,递归(switch)和数组]]></title><link>https://blog.youkuaiyun.com/Trapper_C/article/details/52529462</link><guid>https://blog.youkuaiyun.com/Trapper_C/article/details/52529462</guid><author>Trapper_C</author><pubDate>Tue, 13 Sep 2016 20:59:57 +0800</pubDate><description><![CDATA[表达式求值, 题目链接 ,click here. 
时间限制：3000 ms  |  内存限制：65535 KB 
难度：3描述 
Dr.Kong设计的机器人卡多掌握了加减法运算以后，最近又学会了一些简单的函数求值，比如，它知道函数min(20,23)的值是20 ，add(10,98) 的值是108等等。经过训练，Dr.Kong设计的机器人卡多甚至会计算一种嵌套的更复杂的表达式。 
假设表达式可以简]]></description><category></category></item><item><title><![CDATA[hdu 5806  NanoApe Loves Sequence Ⅱ  前缀和+尺取法]]></title><link>https://blog.youkuaiyun.com/Trapper_C/article/details/52142194</link><guid>https://blog.youkuaiyun.com/Trapper_C/article/details/52142194</guid><author>Trapper_C</author><pubDate>Sun, 07 Aug 2016 12:31:40 +0800</pubDate><description><![CDATA[NanoApe Loves Sequence Ⅱ,原文链接,click  here Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 262144/131072 K (Java/Others) 
Total Submission(s): 596    Accepted Submission(s): 286Problem Descripti]]></description><category></category></item><item><title><![CDATA[AMC-ICPC Live Archive  7295  和  CSU 1715]]></title><link>https://blog.youkuaiyun.com/Trapper_C/article/details/52130397</link><guid>https://blog.youkuaiyun.com/Trapper_C/article/details/52130397</guid><author>Trapper_C</author><pubDate>Fri, 05 Aug 2016 16:30:54 +0800</pubDate><description><![CDATA[对于这两道破题花了我一上午的时间,我感到很愤怒!!!因为自己少看了两个0,WA了一遍又一遍…最后看了题,哭了…QAQ,这道题应该是那种怎么写怎么过的题,简单得要死… 
两道题目链接: 
  AMC-ICPC Live Archive  7295, click here.  
  CSU  1715    click  hrere.题意很简单,就是四个数,可能是等差或等比数列,如果是,求出-1所在位置]]></description><category></category></item><item><title><![CDATA[poj Bad  2377  Cowtractors   prim,kruskal]]></title><link>https://blog.youkuaiyun.com/Trapper_C/article/details/52096584</link><guid>https://blog.youkuaiyun.com/Trapper_C/article/details/52096584</guid><author>Trapper_C</author><pubDate>Tue, 02 Aug 2016 17:53:01 +0800</pubDate><description><![CDATA[Bad Cowtractors,t题目链接,click hereTime Limit: 1000MS      Memory Limit: 65536K 
Total Submissions: 13524        Accepted: 5590 
DescriptionBessie has been hired to build a cheap internet network among Fa]]></description><category></category></item><item><title><![CDATA[nyoj  1112   求次数  map,数组.]]></title><link>https://blog.youkuaiyun.com/Trapper_C/article/details/52032897</link><guid>https://blog.youkuaiyun.com/Trapper_C/article/details/52032897</guid><author>Trapper_C</author><pubDate>Tue, 26 Jul 2016 09:53:55 +0800</pubDate><description><![CDATA[求次数,题目链接,click here .时间限制：1000 ms  |  内存限制：65535 KB
难度：2
描述 
题意很简单，给一个数n 以及一个字符串str，区间【i,i+n-1】 为一个新的字符串，i 属于【0,strlen（str）】如果新的字符串出现过ans++，例如：acmacm n=3,那么 子串为acm cma mac acm ,只有acm出现过求ans;输入 
LINE 1:]]></description><category></category></item><item><title><![CDATA[nyoj 1234 签到题,一个很简单的数学题;]]></title><link>https://blog.youkuaiyun.com/Trapper_C/article/details/51993634</link><guid>https://blog.youkuaiyun.com/Trapper_C/article/details/51993634</guid><author>Trapper_C</author><pubDate>Fri, 22 Jul 2016 12:18:37 +0800</pubDate><description><![CDATA[签到题      nyoj 1234  ,题目链接 click  here签到题 
时间限制：1000 ms  |  内存限制：65535 KB 
难度：2 
描述 
hrw最近看到一个有趣的几何题，题目描述是这样的：一个大圆盘里面放入许多小圆盘，每个小圆盘必须接触大圆盘边缘且与其他小圆盘不能相交，但它们可以互相接触，每个小圆盘具有相同的半径，求此条件下能否放入n个小圆盘。输入 
Multiple]]></description><category></category></item><item><title><![CDATA[hdu 1042  大数阶乘 ,]]></title><link>https://blog.youkuaiyun.com/Trapper_C/article/details/51992183</link><guid>https://blog.youkuaiyun.com/Trapper_C/article/details/51992183</guid><author>Trapper_C</author><pubDate>Fri, 22 Jul 2016 10:12:51 +0800</pubDate><description><![CDATA[hdu 1042 大数阶乘, 　原题链接,　click here.Problem DescriptionGiven an integer N(0 ≤ N ≤ 10000), your task is to calculate N!InputOne N in one line, process to the end of file.OutputFor each N, output N! in one]]></description><category></category></item><item><title><![CDATA[CodeForces 697B  Barnicle   和   Codeforce  691 C Puzzles  科学计数法的正逆互推  CodeForces 691B  一个对称的小题;]]></title><link>https://blog.youkuaiyun.com/Trapper_C/article/details/51925989</link><guid>https://blog.youkuaiyun.com/Trapper_C/article/details/51925989</guid><author>Trapper_C</author><pubDate>Sat, 16 Jul 2016 19:43:11 +0800</pubDate><description><![CDATA[Codeforce   697B    Barnicle   题目链接,  click   here. 
time limit per test1 second 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
Barney is standing in a bar and starrin]]></description><category></category></item><item><title><![CDATA[线段树刷题指南（转载自网络）]]></title><link>https://blog.youkuaiyun.com/Trapper_C/article/details/51919980</link><guid>https://blog.youkuaiyun.com/Trapper_C/article/details/51919980</guid><author>Trapper_C</author><pubDate>Fri, 15 Jul 2016 17:58:52 +0800</pubDate><description><![CDATA[之前做了些线段树相关的题目，开学一段时间后，想着把它整理下，完成了大牛NotOnlySuccess的博文“完全版线段树”里的大部分题目，其博文地址Here，然后也加入了自己做过的一些题目。整理时，更新了之前的代码风格，不过旧的代码仍然保留着。同样分成四类，不好归到前四类的都分到了其他。树状数组能做，线段树都能做（如果是内存限制例外），所以也有些树状数组的题目，会标示出来，并且放到其他类里。一、单点更]]></description><category></category></item><item><title><![CDATA[poj 3468 A Simple Problem with Integers 线段树,区间更新.]]></title><link>https://blog.youkuaiyun.com/Trapper_C/article/details/51919833</link><guid>https://blog.youkuaiyun.com/Trapper_C/article/details/51919833</guid><author>Trapper_C</author><pubDate>Fri, 15 Jul 2016 17:41:43 +0800</pubDate><description><![CDATA[A Simple Problem with Integers,题目链接 ,click here DescriptionYou have N integers, A1, A2, … , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each]]></description><category></category></item><item><title><![CDATA[hdu 1754  I Hate It  线段树]]></title><link>https://blog.youkuaiyun.com/Trapper_C/article/details/51910682</link><guid>https://blog.youkuaiyun.com/Trapper_C/article/details/51910682</guid><author>Trapper_C</author><pubDate>Thu, 14 Jul 2016 16:39:37 +0800</pubDate><description><![CDATA[I Hate It,题目链接 click here. 
Problem Description很多学校流行一种比较的习惯。老师们很喜欢询问，从某某到某某当中，分数最高的是多少。 
这让很多学生很反感。不管你喜不喜欢，现在需要你做的是，就是按照老师的要求，写一个程序，模拟老师的询问。当然，老师有时候需要更新某位同学的成绩。Input本题目包含多组测试，请处理到文件结束。 
在每个测试的第一行，有两个正]]></description><category></category></item><item><title><![CDATA[poj  2236 Wireless Network  并查集]]></title><link>https://blog.youkuaiyun.com/Trapper_C/article/details/51906220</link><guid>https://blog.youkuaiyun.com/Trapper_C/article/details/51906220</guid><author>Trapper_C</author><pubDate>Thu, 14 Jul 2016 09:26:01 +0800</pubDate><description><![CDATA[Wireless Network ,  原文链接, click here  DescriptionAn earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an unexpe]]></description><category></category></item><item><title><![CDATA[搞ACM的伤不起!]]></title><link>https://blog.youkuaiyun.com/Trapper_C/article/details/51896489</link><guid>https://blog.youkuaiyun.com/Trapper_C/article/details/51896489</guid><author>Trapper_C</author><pubDate>Wed, 13 Jul 2016 11:31:45 +0800</pubDate><description><![CDATA[劳资六年前开始搞ACM啊！！！！！！！！！！ 
从此踏上了尼玛不归路啊！！！！！！！！！！！！
谁特么跟劳资讲算法是程序设计的核心啊！！！！！！
尼玛除了面试题就没见过用算法的地方啊！！！！！！ 
谁再跟劳资讲算法之美算法的力量，劳资一本算法导论拍死你啊！！！！！！！！
那是搞ACM的入门书啊！！！！
特么的入门书就一千多页啊！！！！！！！ 
还没有习题答案啊，学完了你特么都不知道自]]></description><category></category></item><item><title><![CDATA[poj 1273 Drainage Ditches 最大流问题.]]></title><link>https://blog.youkuaiyun.com/Trapper_C/article/details/51894921</link><guid>https://blog.youkuaiyun.com/Trapper_C/article/details/51894921</guid><author>Trapper_C</author><pubDate>Wed, 13 Jul 2016 09:42:26 +0800</pubDate><description><![CDATA[Drainage Ditches Time Limit: 1000MS      Memory Limit: 10000K 
Total Submissions: 68476        Accepted: 26518 
DescriptionEvery time it rains on Farmer John’s fields, a pond forms ove]]></description><category></category></item><item><title><![CDATA[hdu  5583  Kingdom of Black and White  思路题]]></title><link>https://blog.youkuaiyun.com/Trapper_C/article/details/51682929</link><guid>https://blog.youkuaiyun.com/Trapper_C/article/details/51682929</guid><author>Trapper_C</author><pubDate>Wed, 15 Jun 2016 15:51:22 +0800</pubDate><description><![CDATA[Kingdom of Black and White 
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) 
Total Submission(s): 1206    Accepted Submission(s): 375Problem DescriptionIn the Kingdo]]></description><category></category></item><item><title><![CDATA[湘潭大学中南邀请赛]]></title><link>https://blog.youkuaiyun.com/Trapper_C/article/details/51660525</link><guid>https://blog.youkuaiyun.com/Trapper_C/article/details/51660525</guid><author>Trapper_C</author><pubDate>Mon, 13 Jun 2016 20:46:06 +0800</pubDate><description><![CDATA[去比赛的时候其实是抱着尽力而为的心态去的,然后舟车劳累,一路感觉状态也不是很好,说实话,我是第一次坐火车,时间很长,睡眠很短... 不过还好,有一晚上的时间休息,调整得还算可以.
    一开始热身赛的时候因为好多人都没来,说是调试环境,就是简单地测试一下编译的Codeblocks能不能用,然后就是用用他们的oj.第二天就是正式赛,去得还不算晚,然后我们赶快调整好状态.把该准备的东西准备好了.一开始]]></description><category></category></item><item><title><![CDATA[HDU  3746  Cyclic Nacklace  kmp求字符串的循环节长度]]></title><link>https://blog.youkuaiyun.com/Trapper_C/article/details/51643763</link><guid>https://blog.youkuaiyun.com/Trapper_C/article/details/51643763</guid><author>Trapper_C</author><pubDate>Sun, 12 Jun 2016 09:24:17 +0800</pubDate><description><![CDATA[Cyclic Nacklace ，题目链接， click here。Cyclic Nacklace 
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) 
Total Submission(s): 6023    Accepted Submission(s): 2690Problem]]></description><category></category></item><item><title><![CDATA[Light oj 1002 - Country Roads  迪杰斯特拉变形]]></title><link>https://blog.youkuaiyun.com/Trapper_C/article/details/51509103</link><guid>https://blog.youkuaiyun.com/Trapper_C/article/details/51509103</guid><author>Trapper_C</author><pubDate>Thu, 26 May 2016 17:24:29 +0800</pubDate><description><![CDATA[Light oj 1002 - Country Roads 题目链接 , click here …1002 - Country Roads 
        PDF (English)   Statistics  ForumTime Limit: 3 second(s) Memory Limit: 32 MBI am going to my home. There are many cities a]]></description><category></category></item><item><title><![CDATA[写了一段时间博客后的反思... ...]]></title><link>https://blog.youkuaiyun.com/Trapper_C/article/details/51479058</link><guid>https://blog.youkuaiyun.com/Trapper_C/article/details/51479058</guid><author>Trapper_C</author><pubDate>Mon, 23 May 2016 09:08:04 +0800</pubDate><description><![CDATA[然后,就被旁边的同学嫌弃了,晚上开过班会之后回来写了两道题,然后想着没事]]></description><category></category></item></channel></rss>