<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Midnight]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/RedMidnight</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; RedMidnight]]></copyright><item><title><![CDATA[linux解压命令]]></title><link>https://blog.youkuaiyun.com/RedMidnight/article/details/84154926</link><guid>https://blog.youkuaiyun.com/RedMidnight/article/details/84154926</guid><author>RedMidnight</author><pubDate>Fri, 17 Feb 2012 22:20:23 +0800</pubDate><description><![CDATA[.tar
解包：tar xvf FileName.tar
打包：tar cvf FileName.tar DirName
（注：tar是打包，不是压缩！）
---------------------------------------------
.gz
解压1：gunzip FileName.gz
解压2：gzip -d FileName.gz
压缩：gzip FileName...]]></description><category></category></item><item><title><![CDATA[转自王道论坛]]></title><link>https://blog.youkuaiyun.com/RedMidnight/article/details/83983269</link><guid>https://blog.youkuaiyun.com/RedMidnight/article/details/83983269</guid><author>RedMidnight</author><pubDate>Tue, 09 Aug 2011 15:12:34 +0800</pubDate><description><![CDATA[[size=small]2009年参加硕士生入学考试已经结束了，初试计算机专业基础141，总成绩403分。我被清华大学计算机系网络研究所录取。在王道一直潜水的，出来发一贴，感谢王道。
一．准备工作（3月到5月）
选择报考的学校：
      人人对于考研的看法都不一样，恐怕每一个要考研的人最想问的一个问题就是考研难吗？我的感觉是考研比高考要简单。我举几个计算机比较牛的学校，想分三个层次说明一...]]></description><category></category></item><item><title><![CDATA[ 2011清华考研机试题2]]></title><link>https://blog.youkuaiyun.com/RedMidnight/article/details/83983246</link><guid>https://blog.youkuaiyun.com/RedMidnight/article/details/83983246</guid><author>RedMidnight</author><pubDate>Tue, 09 Aug 2011 14:56:04 +0800</pubDate><description><![CDATA[[url]http://ac.jobdu.com/problem.php?id=1087[/url]
水~
[code=&quot;c++&quot;]
#include 
#include 
#include 
using namespace std;

long long solved(long long key)
{
	long long ans=0;
	if(key==1)
		ret...]]></description><category></category></item><item><title><![CDATA[2011清华考研机试题1]]></title><link>https://blog.youkuaiyun.com/RedMidnight/article/details/83983230</link><guid>https://blog.youkuaiyun.com/RedMidnight/article/details/83983230</guid><author>RedMidnight</author><pubDate>Tue, 09 Aug 2011 14:40:19 +0800</pubDate><description><![CDATA[题目描述
[url]http://ac.jobdu.com/problem.php?id=1088[/url]
水~
[code=&quot;c++&quot;]
#include 
using namespace std;
int main()
{
	int l,m;
	int trees[10008];
	while(cin&gt;&gt;l&gt;&gt;m)
	{
		int i,j,ans=0;
		fo...]]></description><category></category></item><item><title><![CDATA[考研清华2011复试机考第三题]]></title><link>https://blog.youkuaiyun.com/RedMidnight/article/details/83983185</link><guid>https://blog.youkuaiyun.com/RedMidnight/article/details/83983185</guid><author>RedMidnight</author><pubDate>Tue, 09 Aug 2011 13:51:11 +0800</pubDate><description><![CDATA[[color=blue][size=large]题目描述[/size]
[/color]
[size=small]在某条线路上有N个火车站，有三种距离的路程，L1，L2，L3,对应的价格为C1,C2,C3.其对应关系如下:
距离s           票价
0...]]></description><category></category></item><item><title><![CDATA[poj3259 spfa解法]]></title><link>https://blog.youkuaiyun.com/RedMidnight/article/details/83982858</link><guid>https://blog.youkuaiyun.com/RedMidnight/article/details/83982858</guid><author>RedMidnight</author><pubDate>Mon, 08 Aug 2011 19:59:32 +0800</pubDate><description><![CDATA[同上题，不过改的spfa算法，注意每个节点进入队列的次数至多为n-1次（一共n个节点），若进入大于等于n次了，则说明图中存在负权回路，此时正好满足题目中时光倒流的要求，另外注意，vector每次用的时候清空。
下面是spfa算法的简单说明：
我们用数组d记录每个结点的最短路径估计值，而且用邻接表来存储图G。我们采取的方法是松弛：设立一个先进先出的队列用来保存待优化的结点，优化时每次取出队首结点...]]></description><category></category></item><item><title><![CDATA[poj3259 bellman水题]]></title><link>https://blog.youkuaiyun.com/RedMidnight/article/details/83982770</link><guid>https://blog.youkuaiyun.com/RedMidnight/article/details/83982770</guid><author>RedMidnight</author><pubDate>Mon, 08 Aug 2011 17:04:49 +0800</pubDate><description><![CDATA[poj3259[url]http://poj.org/problem?id=3259[/url]
最简单的bellman，判断是否有负环，n-1次松弛后若还能松弛，则有负环
[code]
#include 
#include 
#define INF 999999999
using namespace std;

struct E
{
	int u;
	int v;
	in...]]></description><category></category></item><item><title><![CDATA[acm题目常用的预处理]]></title><link>https://blog.youkuaiyun.com/RedMidnight/article/details/83982689</link><guid>https://blog.youkuaiyun.com/RedMidnight/article/details/83982689</guid><author>RedMidnight</author><pubDate>Mon, 08 Aug 2011 15:26:07 +0800</pubDate><description><![CDATA[[code=&quot;c++&quot;]
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#defin...]]></description><category></category></item><item><title><![CDATA[poj1860]]></title><link>https://blog.youkuaiyun.com/RedMidnight/article/details/83982633</link><guid>https://blog.youkuaiyun.com/RedMidnight/article/details/83982633</guid><author>RedMidnight</author><pubDate>Mon, 08 Aug 2011 14:06:13 +0800</pubDate><description><![CDATA[poj1860[url]http://poj.org/problem?id=1860[/url]
[code=&quot;c++&quot;]
#include 
#include 
#define ADJUST 0.00000001

using namespace std;

struct E
{
	int start;
	int end;
	double r;
	double c;
...]]></description><category></category></item><item><title><![CDATA[water~9]]></title><link>https://blog.youkuaiyun.com/RedMidnight/article/details/83982092</link><guid>https://blog.youkuaiyun.com/RedMidnight/article/details/83982092</guid><author>RedMidnight</author><pubDate>Sat, 06 Aug 2011 18:01:06 +0800</pubDate><description><![CDATA[poj2109[url]http://poj.org/problem?id=2109[/url]
很神奇的居然a了
[code=&quot;c++&quot;]
#include 
#include 
using namespace std;
int main()
{
	
	double a,b;
    cout.precision(0);
	cout.setf(ios_base::fixed...]]></description><category></category></item><item><title><![CDATA[water~8]]></title><link>https://blog.youkuaiyun.com/RedMidnight/article/details/83982085</link><guid>https://blog.youkuaiyun.com/RedMidnight/article/details/83982085</guid><author>RedMidnight</author><pubDate>Sat, 06 Aug 2011 17:22:27 +0800</pubDate><description><![CDATA[poj2027[url]http://poj.org/problem?id=2027[/url]
just for fun
[code=&quot;c++&quot;] 
#include 
using namespace std;

int main()
{
	int n;
	cin&gt;&gt;n;
	for(int i=0;i&gt;a&gt;&gt;b;
		if(a]]></description><category></category></item><item><title><![CDATA[water~7]]></title><link>https://blog.youkuaiyun.com/RedMidnight/article/details/83982081</link><guid>https://blog.youkuaiyun.com/RedMidnight/article/details/83982081</guid><author>RedMidnight</author><pubDate>Sat, 06 Aug 2011 17:15:34 +0800</pubDate><description><![CDATA[poj1328[url]http://poj.org/problem?id=1328[/url]
比较简单的贪心，看代码，不细说了~
[code=&quot;c++&quot;]
#include 
#include 
#include 
#include 
using namespace std;

struct Space 
{
	double left;
	double right;
...]]></description><category></category></item><item><title><![CDATA[water~6]]></title><link>https://blog.youkuaiyun.com/RedMidnight/article/details/83982006</link><guid>https://blog.youkuaiyun.com/RedMidnight/article/details/83982006</guid><author>RedMidnight</author><pubDate>Sat, 06 Aug 2011 14:27:22 +0800</pubDate><description><![CDATA[poj1088[url]http://poj.org/problem?id=1088[/url]
滑雪，DP，水题
[code=&quot;c++&quot;]
#include 
#include 
using namespace std;

int node[105][105];
int dp[105][105];
int r,c;
int dpit(int i,int j)
{
	if(...]]></description><category></category></item><item><title><![CDATA[water~5]]></title><link>https://blog.youkuaiyun.com/RedMidnight/article/details/83982005</link><guid>https://blog.youkuaiyun.com/RedMidnight/article/details/83982005</guid><author>RedMidnight</author><pubDate>Sat, 06 Aug 2011 14:24:18 +0800</pubDate><description><![CDATA[poj1003[url]http://poj.org/problem?id=1003[/url]
super water~
[code=&quot;c++&quot;]
#include 
using namespace std;

void waterit(double a)
{
	int i=0;
	double s=0.0;
	while(s]]></description><category></category></item><item><title><![CDATA[water~4]]></title><link>https://blog.youkuaiyun.com/RedMidnight/article/details/83982000</link><guid>https://blog.youkuaiyun.com/RedMidnight/article/details/83982000</guid><author>RedMidnight</author><pubDate>Sat, 06 Aug 2011 14:09:05 +0800</pubDate><description><![CDATA[poj1004[url]http://poj.org/problem?id=1004[/url]
super water
[code=&quot;c++&quot;]
#include 
using namespace std;

int main()
{
	double ans=0;

	for(int i=0;i&gt;temp;
		ans+=temp;		
	}
	ans/=12;

...]]></description><category></category></item><item><title><![CDATA[water~3]]></title><link>https://blog.youkuaiyun.com/RedMidnight/article/details/83981999</link><guid>https://blog.youkuaiyun.com/RedMidnight/article/details/83981999</guid><author>RedMidnight</author><pubDate>Sat, 06 Aug 2011 13:59:22 +0800</pubDate><description><![CDATA[poj2159[url]http://poj.org/problem?id=2159[/url]
题目非常水，不过题意非常容易理解错。
[code=&quot;c++&quot;]
#include 
#include 
#include 
using namespace std;


int main()
{
	string str1,str2;
	int a[26],b[26];
	in...]]></description><category></category></item><item><title><![CDATA[water~2]]></title><link>https://blog.youkuaiyun.com/RedMidnight/article/details/83981967</link><guid>https://blog.youkuaiyun.com/RedMidnight/article/details/83981967</guid><author>RedMidnight</author><pubDate>Sat, 06 Aug 2011 12:10:57 +0800</pubDate><description><![CDATA[poj3299[url]http://poj.org/problem?id=3299[/url]
[code=&quot;c++&quot;]
#include 
#include 
#include 
#define EXP 2.718281828

using namespace std;

double funcE(double dewPoint)
{
	return 6.11*pow(E...]]></description><category></category></item><item><title><![CDATA[water~1]]></title><link>https://blog.youkuaiyun.com/RedMidnight/article/details/83981937</link><guid>https://blog.youkuaiyun.com/RedMidnight/article/details/83981937</guid><author>RedMidnight</author><pubDate>Sat, 06 Aug 2011 10:35:07 +0800</pubDate><description><![CDATA[poj1503[url]http://poj.org/problem?id=1503[/url]
[code=&quot;c++&quot;]
#include 
#include 
#include 
#include 
using namespace std;

string ans=&quot;0&quot;;
string inputs[107];
int counts;

string adds(con...]]></description><category></category></item><item><title><![CDATA[POJ3280 简单DP]]></title><link>https://blog.youkuaiyun.com/RedMidnight/article/details/83981634</link><guid>https://blog.youkuaiyun.com/RedMidnight/article/details/83981634</guid><author>RedMidnight</author><pubDate>Fri, 05 Aug 2011 14:48:42 +0800</pubDate><description><![CDATA[poj3280:[url]http://poj.org/problem?id=3280[/url]
[size=small]简单的多子问题多选择dp问题：
dp[i][j]表示字符下标为i到j的子字符串构成回文的最小消费，构成解的子问题有以下两种情况：
1、str[i]!=str[j]，则最小费用为dp[i][j]=min{dp[i+1][j]+cost(str[i]),dp[i][j-1]...]]></description><category></category></item><item><title><![CDATA[POJ3253]]></title><link>https://blog.youkuaiyun.com/RedMidnight/article/details/83980974</link><guid>https://blog.youkuaiyun.com/RedMidnight/article/details/83980974</guid><author>RedMidnight</author><pubDate>Thu, 04 Aug 2011 13:36:50 +0800</pubDate><description><![CDATA[poj3253:[url]http://poj.org/problem?id=3253[/url],简单的哈夫曼问题
[code=&quot;c++&quot;]
#include 
#include 
#include 
using namespace std;

struct cmp
{
	bool operator() (unsigned int x,unsigned int y)
	{
...]]></description><category></category></item></channel></rss>