<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Little_Limbo的专栏]]></title><description><![CDATA[不要把这个世界让给你看不起的人]]></description><link>https://blog.youkuaiyun.com/Litter_Limbo</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Litter_Limbo]]></copyright><item><title><![CDATA[hdu 1003（未完成）]]></title><link>https://blog.youkuaiyun.com/Litter_Limbo/article/details/78565881</link><guid>https://blog.youkuaiyun.com/Litter_Limbo/article/details/78565881</guid><author>Litter_Limbo</author><pubDate>Fri, 17 Nov 2017 22:35:46 +0800</pubDate><description><![CDATA[思路：从第一个数字开始求和，得到求和的数列后求出和的最小值 和和的最大值位置，分两种情况：
当和最小值大于0时，说明开始位置是从第一次数字开始的；
当和最小值小于0事，说明开始位置在此位置的后一位；
注意在第一个位置的判断；


WA，还没想明白；
#include 
#include 
#define N 100005
#define MAX_N 1005
#define MIN_]]></description><category></category></item><item><title><![CDATA[Piggy-Bank—hdu1114完全背包]]></title><link>https://blog.youkuaiyun.com/Litter_Limbo/article/details/51519581</link><guid>https://blog.youkuaiyun.com/Litter_Limbo/article/details/51519581</guid><author>Litter_Limbo</author><pubDate>Fri, 27 May 2016 21:29:51 +0800</pubDate><description><![CDATA[Piggy-Bank
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 19651    Accepted Submission(s): 9975



Problem Description

Before ACM can]]></description><category></category></item><item><title><![CDATA[免费馅饼]]></title><link>https://blog.youkuaiyun.com/Litter_Limbo/article/details/51347328</link><guid>https://blog.youkuaiyun.com/Litter_Limbo/article/details/51347328</guid><author>Litter_Limbo</author><pubDate>Sun, 08 May 2016 20:05:48 +0800</pubDate><description><![CDATA[免费馅饼
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 38633    Accepted Submission(s): 13238



Problem Description

都说天上不会掉馅饼，但有一天gameb]]></description><category></category></item><item><title><![CDATA[Prime Ring Problem——HDU1016]]></title><link>https://blog.youkuaiyun.com/Litter_Limbo/article/details/51347301</link><guid>https://blog.youkuaiyun.com/Litter_Limbo/article/details/51347301</guid><author>Litter_Limbo</author><pubDate>Sun, 08 May 2016 19:55:30 +0800</pubDate><description><![CDATA[Prime Ring Problem
Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 40419    Accepted Submission(s): 17843



Problem Description

A rin]]></description><category></category></item><item><title><![CDATA[Defuse the Bomb——ZOJ3938模拟]]></title><link>https://blog.youkuaiyun.com/Litter_Limbo/article/details/51347253</link><guid>https://blog.youkuaiyun.com/Litter_Limbo/article/details/51347253</guid><author>Litter_Limbo</author><pubDate>Sun, 08 May 2016 19:45:15 +0800</pubDate><description><![CDATA[Defuse the Bomb

Time Limit: 2 Seconds      Memory Limit: 65536 KB

The bomb is about to explode! Please defuse it as soon as possible!
There is a display showing a number from 1 to 4 on the bomb]]></description><category></category></item><item><title><![CDATA[poj 3253 Fence Repair]]></title><link>https://blog.youkuaiyun.com/Litter_Limbo/article/details/50993960</link><guid>https://blog.youkuaiyun.com/Litter_Limbo/article/details/50993960</guid><author>Litter_Limbo</author><pubDate>Sun, 27 Mar 2016 21:22:38 +0800</pubDate><description><![CDATA[Fence Repair




Time Limit: 2000MS
 
Memory Limit: 65536K


Total Submissions: 36991
 
Accepted: 11970




Description

Farmer John wants to repair a small length of the fence arou]]></description><category></category></item><item><title><![CDATA[数字反演]]></title><link>https://blog.youkuaiyun.com/Litter_Limbo/article/details/50990610</link><guid>https://blog.youkuaiyun.com/Litter_Limbo/article/details/50990610</guid><author>Litter_Limbo</author><pubDate>Sun, 27 Mar 2016 11:03:00 +0800</pubDate><description><![CDATA[Description
While Patrick was gone shopping, Spongebob decided to play a little trick on his friend. The naughty Sponge browsed through Patrick's personal stuff and found a sequence a1,?a2,?...,?am o]]></description><category></category></item><item><title><![CDATA[N皇后问题]]></title><link>https://blog.youkuaiyun.com/Litter_Limbo/article/details/50990514</link><guid>https://blog.youkuaiyun.com/Litter_Limbo/article/details/50990514</guid><author>Litter_Limbo</author><pubDate>Sun, 27 Mar 2016 10:44:50 +0800</pubDate><description><![CDATA[题目就不多说了，昨天要交个作业，今天把想到的都记录一下；
递归回溯算法一：
#include
#include
#define N 100
using namespace std;
int board[N];
int n,ans = 0;
void Trial(int i,int n);
bool Judge(int i,int j) {
    if(j > n || i > n)retur]]></description><category></category></item><item><title><![CDATA[BestCoder Round #77 (div.2)xiaoxin juju needs help]]></title><link>https://blog.youkuaiyun.com/Litter_Limbo/article/details/50989058</link><guid>https://blog.youkuaiyun.com/Litter_Limbo/article/details/50989058</guid><author>Litter_Limbo</author><pubDate>Sat, 26 Mar 2016 21:49:48 +0800</pubDate><description><![CDATA[xiaoxin juju needs help
 

 Accepts: 150
 

 Submissions: 966




 Time Limit: 2000/1000 MS (Java/Others)
 
 Memory Limit: 65536/65536 K (Java/Others)



问题描述
xiaoxin巨从小就喜欢字符串，六年级的时候]]></description><category></category></item><item><title><![CDATA[BestCoder Round #77 (div.2) 1001 so easy]]></title><link>https://blog.youkuaiyun.com/Litter_Limbo/article/details/50988829</link><guid>https://blog.youkuaiyun.com/Litter_Limbo/article/details/50988829</guid><author>Litter_Limbo</author><pubDate>Sat, 26 Mar 2016 21:02:21 +0800</pubDate><description><![CDATA[so easy
 

 Accepts: 518
 

 Submissions: 1601



 Time Limit: 2000/1000 MS (Java/Others)
 
 Memory Limit: 65536/65536 K (Java/Others)





Problem Description

Given an array with]]></description><category></category></item><item><title><![CDATA[sql语法回顾：“fetch: 提取类型 last 不能与只进游标一起使用。”]]></title><link>https://blog.youkuaiyun.com/Litter_Limbo/article/details/50856216</link><guid>https://blog.youkuaiyun.com/Litter_Limbo/article/details/50856216</guid><author>Litter_Limbo</author><pubDate>Fri, 11 Mar 2016 15:10:08 +0800</pubDate><description><![CDATA[declare @qk char(4)
declare cqk   cursor  for
select qkb.qkh from qkb,tgb where (qkm = '计算机学报' and qkb.qkh = tgb.qkh and sgjg = '未通过')
open cqk
fetch last from  cqk into  @qk
update tgb set sgjg = '通过]]></description><category></category></item><item><title><![CDATA[HDU __5437 Alisha’s Party]]></title><link>https://blog.youkuaiyun.com/Litter_Limbo/article/details/48502043</link><guid>https://blog.youkuaiyun.com/Litter_Limbo/article/details/48502043</guid><author>Litter_Limbo</author><pubDate>Wed, 16 Sep 2015 21:38:47 +0800</pubDate><description><![CDATA[Alisha’s Party
Time Limit: 3000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 2513    Accepted Submission(s): 681


Problem Description
Princess Alish]]></description><category></category></item><item><title><![CDATA[POJ——3468A Simple Problem with Integers（区间更新）]]></title><link>https://blog.youkuaiyun.com/Litter_Limbo/article/details/47806845</link><guid>https://blog.youkuaiyun.com/Litter_Limbo/article/details/47806845</guid><author>Litter_Limbo</author><pubDate>Thu, 20 Aug 2015 14:04:58 +0800</pubDate><description><![CDATA[A Simple Problem with Integers




Time Limit: 5000MS
 
Memory Limit: 131072K


Total Submissions: 78332
 
Accepted: 24139


Case Time Limit: 2000MS




Description

You have N i]]></description><category></category></item><item><title><![CDATA[HDU1556——Color the ball（区间更新OR树状数组）]]></title><link>https://blog.youkuaiyun.com/Litter_Limbo/article/details/47751403</link><guid>https://blog.youkuaiyun.com/Litter_Limbo/article/details/47751403</guid><author>Litter_Limbo</author><pubDate>Tue, 18 Aug 2015 14:40:34 +0800</pubDate><description><![CDATA[Color the ball
Time Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 12999    Accepted Submission(s): 6503


Problem Description
N个气球排成一排，从左到右依]]></description><category></category></item><item><title><![CDATA[HDU-1698 Just a Hook(区间更新）]]></title><link>https://blog.youkuaiyun.com/Litter_Limbo/article/details/47615143</link><guid>https://blog.youkuaiyun.com/Litter_Limbo/article/details/47615143</guid><author>Litter_Limbo</author><pubDate>Thu, 13 Aug 2015 16:50:03 +0800</pubDate><description><![CDATA[Just a Hook
Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 22759    Accepted Submission(s): 11383


Problem Description
In the game of D]]></description><category></category></item><item><title><![CDATA[HDU——2521反素数]]></title><link>https://blog.youkuaiyun.com/Litter_Limbo/article/details/47322267</link><guid>https://blog.youkuaiyun.com/Litter_Limbo/article/details/47322267</guid><author>Litter_Limbo</author><pubDate>Thu, 06 Aug 2015 20:23:06 +0800</pubDate><description><![CDATA[反素数
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4899    Accepted Submission(s): 2882


Problem Description
反素数就是满足对于任意i(0

 

Inp]]></description><category></category></item><item><title><![CDATA[HDU-- 2015 Multi-University Training Contest 6  Cake]]></title><link>https://blog.youkuaiyun.com/Litter_Limbo/article/details/47321365</link><guid>https://blog.youkuaiyun.com/Litter_Limbo/article/details/47321365</guid><author>Litter_Limbo</author><pubDate>Thu, 06 Aug 2015 19:24:27 +0800</pubDate><description><![CDATA[Cake
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 0    Accepted Submission(s): 0
Special Judge

Problem Description

There are m so]]></description><category></category></item><item><title><![CDATA[POJ---2828 Buy Tickets]]></title><link>https://blog.youkuaiyun.com/Litter_Limbo/article/details/47319603</link><guid>https://blog.youkuaiyun.com/Litter_Limbo/article/details/47319603</guid><author>Litter_Limbo</author><pubDate>Thu, 06 Aug 2015 18:59:10 +0800</pubDate><description><![CDATA[Buy Tickets




Time Limit: 4000MS
 
Memory Limit: 65536K


Total Submissions: 15846
 
Accepted: 7893




Description

Railway tickets were difficult to buy around the Lunar New Yea]]></description><category></category></item><item><title><![CDATA[HDU--2795  Billboard]]></title><link>https://blog.youkuaiyun.com/Litter_Limbo/article/details/47275789</link><guid>https://blog.youkuaiyun.com/Litter_Limbo/article/details/47275789</guid><author>Litter_Limbo</author><pubDate>Tue, 04 Aug 2015 14:04:12 +0800</pubDate><description><![CDATA[Billboard
Time Limit: 20000/8000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 14772    Accepted Submission(s): 6311


Problem Description
At the entrance to]]></description><category></category></item><item><title><![CDATA[HDU--1394 Minimum Inversion Number]]></title><link>https://blog.youkuaiyun.com/Litter_Limbo/article/details/47273579</link><guid>https://blog.youkuaiyun.com/Litter_Limbo/article/details/47273579</guid><author>Litter_Limbo</author><pubDate>Tue, 04 Aug 2015 11:18:38 +0800</pubDate><description><![CDATA[Minimum Inversion Number
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 14138    Accepted Submission(s): 8625


Problem Description
The ]]></description><category></category></item></channel></rss>