<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[你说我能坚持多久。。]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/u011389986</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; u011389986]]></copyright><item><title><![CDATA[有序表查找]]></title><link>https://blog.youkuaiyun.com/u011389986/article/details/49363073</link><guid>https://blog.youkuaiyun.com/u011389986/article/details/49363073</guid><author>u011389986</author><pubDate>Fri, 23 Oct 2015 17:09:07 +0800</pubDate><description><![CDATA[/*顺序查找*/
int sequence_search(int *a, int num, int x)
{
    int i;
    for(i = 0; i < num && a[i] != x; i++);
    if(i < n) return i;
    else return -1;
}

/*二分查找*/
int two_point_search(int *a, int nu]]></description><category></category></item><item><title><![CDATA[内部排序]]></title><link>https://blog.youkuaiyun.com/u011389986/article/details/49362525</link><guid>https://blog.youkuaiyun.com/u011389986/article/details/49362525</guid><author>u011389986</author><pubDate>Fri, 23 Oct 2015 15:54:36 +0800</pubDate><description><![CDATA[/*插入排序*/
/*直接插入： 稳定 O(n^2)*/
void insertion_sort(int *a, int num)
{
    int tmp;
    for(int i = 1; i < num; i++)
    {
        tmp = a[i];
        int j;
        for(j = i - 1; j >= 0 && tmp < a[j]; ]]></description><category></category></item><item><title><![CDATA[POJ 3660 Cow Contest]]></title><link>https://blog.youkuaiyun.com/u011389986/article/details/10021593</link><guid>https://blog.youkuaiyun.com/u011389986/article/details/10021593</guid><author>u011389986</author><pubDate>Sat, 17 Aug 2013 11:38:42 +0800</pubDate><description><![CDATA[Cow Contest




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 6213
 
Accepted: 3360




Description


N (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are partici]]></description><category></category></item><item><title><![CDATA[HDU 4198 Quick out of the Harbour（优先队列）]]></title><link>https://blog.youkuaiyun.com/u011389986/article/details/10008585</link><guid>https://blog.youkuaiyun.com/u011389986/article/details/10008585</guid><author>u011389986</author><pubDate>Fri, 16 Aug 2013 19:08:19 +0800</pubDate><description><![CDATA[题意：
给出h*w的图 图中'@'表示桥 给出通过桥的时间k
求最短离开的时间
 
代码：
 #include
#include
#include
#define MAX 502
using namespace std;

struct node
{
	int x,y,time;
	friend bool operator < (node a,node b)  //时间]]></description><category></category></item><item><title><![CDATA[HDU 2579 Dating with girls(2)]]></title><link>https://blog.youkuaiyun.com/u011389986/article/details/10007813</link><guid>https://blog.youkuaiyun.com/u011389986/article/details/10007813</guid><author>u011389986</author><pubDate>Fri, 16 Aug 2013 18:12:40 +0800</pubDate><description><![CDATA[题意：
给出r*c的图 以及时间k
图中'.'代表通路 '#'代表障碍物
当时间为k的倍数时 障碍物消失
问从起始点到终点的最短时间
 
代码：
#include
#include
#include
#define MAX 102
using namespace std;

struct node
{
	int x,y,time;
};

queue q;
c]]></description><category></category></item><item><title><![CDATA[HDU 4308 Saving Princess claire_]]></title><link>https://blog.youkuaiyun.com/u011389986/article/details/10002961</link><guid>https://blog.youkuaiyun.com/u011389986/article/details/10002961</guid><author>u011389986</author><pubDate>Fri, 16 Aug 2013 15:26:56 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=4308
 
题意：
给出一个r*c的图以及走一步所需的花费
'Y'表示起始点 'C'表示重点
'*'表示可以达到的点 '#'表示不能达到的点
'P'表示可瞬间转换的点，及若从一个'P'点进入，可由下一个'P'点开始搜索
求到达'C'点的最小花费
('P'点间转化不需要花费)
 
代码：
#i]]></description><category></category></item><item><title><![CDATA[POJ 2402 Palindrome Numbers]]></title><link>https://blog.youkuaiyun.com/u011389986/article/details/10000801</link><guid>https://blog.youkuaiyun.com/u011389986/article/details/10000801</guid><author>u011389986</author><pubDate>Fri, 16 Aug 2013 13:46:32 +0800</pubDate><description><![CDATA[Palindrome Numbers




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 3568
 
Accepted: 1333




Description
A palindrome is a word, number, or phrase that reads the s]]></description><category></category></item><item><title><![CDATA[POJ 1703 Find them, Catch them]]></title><link>https://blog.youkuaiyun.com/u011389986/article/details/9996629</link><guid>https://blog.youkuaiyun.com/u011389986/article/details/9996629</guid><author>u011389986</author><pubDate>Fri, 16 Aug 2013 10:03:22 +0800</pubDate><description><![CDATA[Find them, Catch them




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 25909
 
Accepted: 7832




Description
The police office in Tadu City decides to say ends to ]]></description><category></category></item><item><title><![CDATA[POJ 2230 Watchcow]]></title><link>https://blog.youkuaiyun.com/u011389986/article/details/9899519</link><guid>https://blog.youkuaiyun.com/u011389986/article/details/9899519</guid><author>u011389986</author><pubDate>Tue, 13 Aug 2013 09:19:52 +0800</pubDate><description><![CDATA[Watchcow




Time Limit: 3000MS
 
Memory Limit: 65536K


Total Submissions: 5362
 
Accepted: 2256
 
Special Judge




Description
Bessie's been appointed the new watch-cow for the]]></description><category></category></item><item><title><![CDATA[POJ 1386 Play on Words]]></title><link>https://blog.youkuaiyun.com/u011389986/article/details/9772933</link><guid>https://blog.youkuaiyun.com/u011389986/article/details/9772933</guid><author>u011389986</author><pubDate>Mon, 05 Aug 2013 21:41:13 +0800</pubDate><description><![CDATA[Play on Words




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 8494
 
Accepted: 2964




Description
Some of the secret doors contain a very interesting word puzzle]]></description><category></category></item><item><title><![CDATA[HDU 3018 Ant Trip]]></title><link>https://blog.youkuaiyun.com/u011389986/article/details/9769621</link><guid>https://blog.youkuaiyun.com/u011389986/article/details/9769621</guid><author>u011389986</author><pubDate>Mon, 05 Aug 2013 17:04:38 +0800</pubDate><description><![CDATA[Ant Trip




Time Limit: 1000MS
 
Memory Limit: 32768KB
 
64bit IO Format: %I64d & %I64u






Description

Ant Country consist of N towns.There are M roads connecting the towns.]]></description><category></category></item><item><title><![CDATA[POJ 2594 Treasure Exploration]]></title><link>https://blog.youkuaiyun.com/u011389986/article/details/9764525</link><guid>https://blog.youkuaiyun.com/u011389986/article/details/9764525</guid><author>u011389986</author><pubDate>Mon, 05 Aug 2013 11:25:23 +0800</pubDate><description><![CDATA[Treasure Exploration




Time Limit: 6000MS
 
Memory Limit: 65536K


Total Submissions: 6059
 
Accepted: 2425




Description
Have you ever read any book about treasure exploration? ]]></description><category></category></item><item><title><![CDATA[POJ 1422 Air Raid]]></title><link>https://blog.youkuaiyun.com/u011389986/article/details/9764331</link><guid>https://blog.youkuaiyun.com/u011389986/article/details/9764331</guid><author>u011389986</author><pubDate>Mon, 05 Aug 2013 11:18:29 +0800</pubDate><description><![CDATA[Air Raid




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 6018
 
Accepted: 3600




Description
Consider a town where all the streets are one-way and each street le]]></description><category></category></item><item><title><![CDATA[POJ 2446 Chessboard]]></title><link>https://blog.youkuaiyun.com/u011389986/article/details/9764181</link><guid>https://blog.youkuaiyun.com/u011389986/article/details/9764181</guid><author>u011389986</author><pubDate>Mon, 05 Aug 2013 11:10:16 +0800</pubDate><description><![CDATA[Chessboard




Time Limit: 2000MS
 
Memory Limit: 65536K


Total Submissions: 11700
 
Accepted: 3653




Description
Alice and Bob often play games on chessboard. One day, Alice draw]]></description><category></category></item><item><title><![CDATA[POJ 1469 COURSES]]></title><link>https://blog.youkuaiyun.com/u011389986/article/details/9764035</link><guid>https://blog.youkuaiyun.com/u011389986/article/details/9764035</guid><author>u011389986</author><pubDate>Mon, 05 Aug 2013 11:03:54 +0800</pubDate><description><![CDATA[COURSES




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 15404
 
Accepted: 6085




Description
Consider a group of N students and P courses. Each student visits ze]]></description><category></category></item><item><title><![CDATA[POJ 1325 Machine Schedule]]></title><link>https://blog.youkuaiyun.com/u011389986/article/details/9763907</link><guid>https://blog.youkuaiyun.com/u011389986/article/details/9763907</guid><author>u011389986</author><pubDate>Mon, 05 Aug 2013 10:58:36 +0800</pubDate><description><![CDATA[Machine Schedule




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 10428
 
Accepted: 4414




Description
As we all know, machine scheduling is a very classical prob]]></description><category></category></item><item><title><![CDATA[POJ 1659 Frogs' Neighborhood]]></title><link>https://blog.youkuaiyun.com/u011389986/article/details/9730425</link><guid>https://blog.youkuaiyun.com/u011389986/article/details/9730425</guid><author>u011389986</author><pubDate>Sat, 03 Aug 2013 10:49:44 +0800</pubDate><description><![CDATA[Frogs' Neighborhood




Time Limit: 5000MS
 
Memory Limit: 10000K


Total Submissions: 6038
 
Accepted: 2614
 
Special Judge




Description

未名湖附近共有N个大小湖泊L1, L2, ..., 
Ln(其中包括未名]]></description><category></category></item><item><title><![CDATA[HDU 2063 过山车]]></title><link>https://blog.youkuaiyun.com/u011389986/article/details/9730281</link><guid>https://blog.youkuaiyun.com/u011389986/article/details/9730281</guid><author>u011389986</author><pubDate>Sat, 03 Aug 2013 10:37:36 +0800</pubDate><description><![CDATA[过山车




Time Limit: 1000MS
 
Memory Limit: 32768KB
 
64bit IO Format: %I64d & %I64u




[Submit]   [Go
 Back]   [Status]  


Description

RPG girls今天和大家一起去游乐场玩，终于可以坐上梦寐以求的过山车了。可是，过]]></description><category></category></item><item><title><![CDATA[POJ 1847 Tram]]></title><link>https://blog.youkuaiyun.com/u011389986/article/details/9722957</link><guid>https://blog.youkuaiyun.com/u011389986/article/details/9722957</guid><author>u011389986</author><pubDate>Fri, 02 Aug 2013 23:21:07 +0800</pubDate><description><![CDATA[Tram




Time Limit: 1000MS
 
Memory Limit: 30000K


Total Submissions: 8688
 
Accepted: 3155




Description
Tram network in Zagreb consists of a number of intersections and rails c]]></description><category></category></item><item><title><![CDATA[HDU 1520 Anniversary party （树状dp）]]></title><link>https://blog.youkuaiyun.com/u011389986/article/details/9722889</link><guid>https://blog.youkuaiyun.com/u011389986/article/details/9722889</guid><author>u011389986</author><pubDate>Fri, 02 Aug 2013 23:00:37 +0800</pubDate><description><![CDATA[Anniversary party




Time Limit: 1000MS
 
Memory Limit: 32768KB
 
64bit IO Format: %I64d & %I64u




[Submit]   [Go
 Back]   [Status]  


Description

There is going to be a party]]></description><category></category></item></channel></rss>