<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Phoenix]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/phoenix_wei</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; phoenix_wei]]></copyright><item><title><![CDATA[2018浙大计算机考研经验]]></title><link>https://blog.youkuaiyun.com/phoenix_wei/article/details/79673687</link><guid>https://blog.youkuaiyun.com/phoenix_wei/article/details/79673687</guid><author>phoenix_wei</author><pubDate>Fri, 23 Mar 2018 23:01:34 +0800</pubDate><description><![CDATA[2018考研数学经验详谈

2018考研计算机408经验详谈

2018浙大计算机考研经验贴



前言：

   光阴似箭，岁月如梭。从2017年三月开始到现在，整整一年的考研准备（初试+复试）终于落下了帷幕，最终我以初试417、上机86、面试93.4分被ZJUCS学硕第3名拟录取，2018考研也算落下了帷幕。一方面回忆一下这段破茧而出的岁月，另一方面考研期间受到了众多学长学姐的鼓励与...]]></description><category></category></item><item><title><![CDATA[2018考研计算机408经验详谈]]></title><link>https://blog.youkuaiyun.com/phoenix_wei/article/details/79659614</link><guid>https://blog.youkuaiyun.com/phoenix_wei/article/details/79659614</guid><author>phoenix_wei</author><pubDate>Thu, 22 Mar 2018 20:46:07 +0800</pubDate><description><![CDATA[2018浙大计算机考研经验总述

2018考研数学经验详谈

考研408经验详谈

备考时间：2017.03.10

基础情况：数据结构，计组，操作系统，网络水过。。。基础约为零。。。

实考成绩：133



前言：408备考最讲求“反复多次与全面”，这句话在王道单科书-《操作系统复习指导》中出现了三次，可见这句话对于复习408而言是十分重要的，我也在复习过程中对这句话十分有感触，量变总会产生...]]></description><category></category></item><item><title><![CDATA[PATA1022题解]]></title><link>https://blog.youkuaiyun.com/phoenix_wei/article/details/79426272</link><guid>https://blog.youkuaiyun.com/phoenix_wei/article/details/79426272</guid><author>phoenix_wei</author><pubDate>Fri, 02 Mar 2018 19:00:17 +0800</pubDate><description><![CDATA[#include &amp;lt;cstdio&amp;gt;
#include &amp;lt;iostream&amp;gt;
#include &amp;lt;map&amp;gt;
#include &amp;lt;set&amp;gt;
#include &amp;lt;string&amp;gt;
#include &amp;lt;algorithm&amp;gt;
using namespace std;
const int maxn = 10010;
map&amp;lt;strin...]]></description><category></category></item><item><title><![CDATA[PATA1018题解]]></title><link>https://blog.youkuaiyun.com/phoenix_wei/article/details/79425666</link><guid>https://blog.youkuaiyun.com/phoenix_wei/article/details/79425666</guid><author>phoenix_wei</author><pubDate>Fri, 02 Mar 2018 17:30:47 +0800</pubDate><description><![CDATA[#include &amp;lt;cstdio&amp;gt;
#include &amp;lt;iostream&amp;gt;
#include &amp;lt;queue&amp;gt;
#include &amp;lt;vector&amp;gt;
#include &amp;lt;algorithm&amp;gt;
using namespace std;
const int maxn = 510;
const int inf = 1000000000;
int C...]]></description><category></category></item><item><title><![CDATA[PAT第二轮刷题总结]]></title><link>https://blog.youkuaiyun.com/phoenix_wei/article/details/79381683</link><guid>https://blog.youkuaiyun.com/phoenix_wei/article/details/79381683</guid><author>phoenix_wei</author><pubDate>Mon, 26 Feb 2018 21:26:25 +0800</pubDate><description><![CDATA[      第二轮刷题比原计划迟了快要一周，此轮刷题伴随着初试成绩公布与过年，效率简直不忍直视==22号回到学校又把最近几套真题刷了一遍，在之前刷过的基础上速度快了很多，准确率也提高很多。      此轮刷题树、图等常用模版基本上已经熟练掌握，stl的使用也更加娴熟，个别复杂的模版如（AVL树、二分查找相同元素的最左、右的那个元素、堆排）等还需继续强化。。      接下来每天继续保证一定量的刷题...]]></description><category></category></item><item><title><![CDATA[PATA1139题解]]></title><link>https://blog.youkuaiyun.com/phoenix_wei/article/details/79381410</link><guid>https://blog.youkuaiyun.com/phoenix_wei/article/details/79381410</guid><author>phoenix_wei</author><pubDate>Mon, 26 Feb 2018 20:34:58 +0800</pubDate><description><![CDATA[三个坑点：
1、测试数据中有-0000
2、输出的朋友对为四位数
3、当a，b性别相同时，要判断a的朋友c不为b， b的朋友d不为a


//
//  main.cpp
//  PATA1139
//
//  Created by Phoenix on 2018/2/26.
//  Copyright © 2018年 Phoenix. All rights reserved.
//

]]></description><category></category></item><item><title><![CDATA[PATA1138题解]]></title><link>https://blog.youkuaiyun.com/phoenix_wei/article/details/79380912</link><guid>https://blog.youkuaiyun.com/phoenix_wei/article/details/79380912</guid><author>phoenix_wei</author><pubDate>Mon, 26 Feb 2018 19:26:18 +0800</pubDate><description><![CDATA[通过前序遍历和中序遍历构造二叉树，输出后序遍历第一个节点的值
//
//  main.cpp
//  PATA1138
//
//  Created by Phoenix on 2018/2/26.
//  Copyright © 2018年 Phoenix. All rights reserved.
//

#include 
#include 
const int maxn = 50010;]]></description><category></category></item><item><title><![CDATA[PATA1137题解]]></title><link>https://blog.youkuaiyun.com/phoenix_wei/article/details/79380833</link><guid>https://blog.youkuaiyun.com/phoenix_wei/article/details/79380833</guid><author>phoenix_wei</author><pubDate>Mon, 26 Feb 2018 19:14:08 +0800</pubDate><description><![CDATA[排序题
//
//  main.cpp
//  PATA1137
//
//  Created by Phoenix on 2018/2/26.
//  Copyright © 2018年 Phoenix. All rights reserved.
//

#include 
#include 
#include 
#include 
#include 
using namespace std;]]></description><category></category></item><item><title><![CDATA[PATA1136题解]]></title><link>https://blog.youkuaiyun.com/phoenix_wei/article/details/79380654</link><guid>https://blog.youkuaiyun.com/phoenix_wei/article/details/79380654</guid><author>phoenix_wei</author><pubDate>Mon, 26 Feb 2018 18:49:19 +0800</pubDate><description><![CDATA[字符串与数字转换的题目
//
//  main.cpp
//  PATA1136
//
//  Created by Phoenix on 2018/2/26.
//  Copyright © 2018年 Phoenix. All rights reserved.
//

#include 
#include 
#include 
#include 
using namespace std;

]]></description><category></category></item><item><title><![CDATA[PATA1135题解]]></title><link>https://blog.youkuaiyun.com/phoenix_wei/article/details/79375431</link><guid>https://blog.youkuaiyun.com/phoenix_wei/article/details/79375431</guid><author>phoenix_wei</author><pubDate>Mon, 26 Feb 2018 11:48:16 +0800</pubDate><description><![CDATA[题意：
1、每个节点非红即黑
2、根节点为黑
3、每个叶节点均为黑（判断数量时可以忽略这个条件）
4、如果一个节点为红，则它的孩子节点为黑色
5、对于每个节点，从该节点出发到任何一个它的子孙叶节点所包含的黑色节点数相同


//
//  main.cpp
//  PATA1135
//
//  Created by Phoenix on 2018/2/26.
//  Copyrig]]></description><category></category></item><item><title><![CDATA[PATA1134题解]]></title><link>https://blog.youkuaiyun.com/phoenix_wei/article/details/79374857</link><guid>https://blog.youkuaiyun.com/phoenix_wei/article/details/79374857</guid><author>phoenix_wei</author><pubDate>Mon, 26 Feb 2018 11:13:05 +0800</pubDate><description><![CDATA[判断集合的点是否覆盖所有边
//
//  main.cpp
//  PATA1134
//
//  Created by Phoenix on 2018/2/26.
//  Copyright © 2018年 Phoenix. All rights reserved.
//

#include 
#include 
#include 
using namespace std;

const in]]></description><category></category></item><item><title><![CDATA[PATA1133题解]]></title><link>https://blog.youkuaiyun.com/phoenix_wei/article/details/79373824</link><guid>https://blog.youkuaiyun.com/phoenix_wei/article/details/79373824</guid><author>phoenix_wei</author><pubDate>Mon, 26 Feb 2018 10:06:41 +0800</pubDate><description><![CDATA[排序题
//
//  main.cpp
//  PATA1133
//
//  Created by Phoenix on 2018/2/26.
//  Copyright © 2018年 Phoenix. All rights reserved.
//

#include 
#include 
#include 
using namespace std;
const int maxn = 10]]></description><category></category></item><item><title><![CDATA[PATA1132题解]]></title><link>https://blog.youkuaiyun.com/phoenix_wei/article/details/79373146</link><guid>https://blog.youkuaiyun.com/phoenix_wei/article/details/79373146</guid><author>phoenix_wei</author><pubDate>Mon, 26 Feb 2018 09:00:08 +0800</pubDate><description><![CDATA[注意排除后半部分为零的情况
//
//  main.cpp
//  PATA1132
//
//  Created by Phoenix on 2018/2/26.
//  Copyright © 2018年 Phoenix. All rights reserved.
//

#include 
#include 
#include 

int main(int argc, const char]]></description><category></category></item><item><title><![CDATA[PATA1129题解]]></title><link>https://blog.youkuaiyun.com/phoenix_wei/article/details/79373007</link><guid>https://blog.youkuaiyun.com/phoenix_wei/article/details/79373007</guid><author>phoenix_wei</author><pubDate>Mon, 26 Feb 2018 08:18:25 +0800</pubDate><description><![CDATA[//
//  main.cpp
//  PATA1129
//
//  Created by Phoenix on 2018/2/25.
//  Copyright © 2018年 Phoenix. All rights reserved.
//

#include 
#include 
#include 
using namespace std;
const int maxn = 50010;
]]></description><category></category></item><item><title><![CDATA[PATA1131题解]]></title><link>https://blog.youkuaiyun.com/phoenix_wei/article/details/79369666</link><guid>https://blog.youkuaiyun.com/phoenix_wei/article/details/79369666</guid><author>phoenix_wei</author><pubDate>Sun, 25 Feb 2018 16:26:55 +0800</pubDate><description><![CDATA[使用Dijkstra会有测试点超时
DFS没有剪枝也会有测试点超时
//
//  main.cpp
//  PATA1131
//
//  Created by Phoenix on 2018/2/25.
//  Copyright © 2018年 Phoenix. All rights reserved.
//

#include 
#include 
#include 
using nam]]></description><category></category></item><item><title><![CDATA[PATA1130题解]]></title><link>https://blog.youkuaiyun.com/phoenix_wei/article/details/79369008</link><guid>https://blog.youkuaiyun.com/phoenix_wei/article/details/79369008</guid><author>phoenix_wei</author><pubDate>Sun, 25 Feb 2018 15:14:47 +0800</pubDate><description><![CDATA[//
//  main.cpp
//  PATA1130
//
//  Created by Phoenix on 2018/2/25.
//  Copyright © 2018年 Phoenix. All rights reserved.
//

#include 
#include 
int n, flag[22] = {0};
struct Node {
    char str[13];
]]></description><category></category></item><item><title><![CDATA[PATA1128题解]]></title><link>https://blog.youkuaiyun.com/phoenix_wei/article/details/79368583</link><guid>https://blog.youkuaiyun.com/phoenix_wei/article/details/79368583</guid><author>phoenix_wei</author><pubDate>Sun, 25 Feb 2018 14:14:12 +0800</pubDate><description><![CDATA[//
//  main.cpp
//  PATA1128
//
//  Created by Phoenix on 2018/2/25.
//  Copyright © 2018年 Phoenix. All rights reserved.
//

#include 
#include 
#include 
using namespace std;
const int maxn = 1010;

]]></description><category></category></item><item><title><![CDATA[PATA1127题解]]></title><link>https://blog.youkuaiyun.com/phoenix_wei/article/details/79367630</link><guid>https://blog.youkuaiyun.com/phoenix_wei/article/details/79367630</guid><author>phoenix_wei</author><pubDate>Sun, 25 Feb 2018 11:14:19 +0800</pubDate><description><![CDATA[通过中序遍历和后序遍历构造二叉树，再通过层序遍历，奇数行输出逆序，偶数行输出顺序，利用栈来存储
//
//  main.cpp
//  PATA1127
//
//  Created by Phoenix on 2018/2/25.
//  Copyright © 2018年 Phoenix. All rights reserved.
//

#include 
#include 
#inclu]]></description><category></category></item><item><title><![CDATA[PATA1126题解]]></title><link>https://blog.youkuaiyun.com/phoenix_wei/article/details/79367458</link><guid>https://blog.youkuaiyun.com/phoenix_wei/article/details/79367458</guid><author>phoenix_wei</author><pubDate>Sun, 25 Feb 2018 10:53:45 +0800</pubDate><description><![CDATA[注意要判断是否为联通图
//
//  main.cpp
//  PATA1126
//
//  Created by Phoenix on 2018/2/25.
//  Copyright © 2018年 Phoenix. All rights reserved.
//

#include 
#include 
const int maxn = 510;
int n, m;
int father]]></description><category></category></item><item><title><![CDATA[PATA1125题解]]></title><link>https://blog.youkuaiyun.com/phoenix_wei/article/details/79367368</link><guid>https://blog.youkuaiyun.com/phoenix_wei/article/details/79367368</guid><author>phoenix_wei</author><pubDate>Sun, 25 Feb 2018 10:42:51 +0800</pubDate><description><![CDATA[直接将数组存为int型即可
//
//  main.cpp
//  PATA1125
//
//  Created by Phoenix on 2018/2/25.
//  Copyright © 2018年 Phoenix. All rights reserved.
//

#include 
#include 
#include 
using namespace std;

int main]]></description><category></category></item></channel></rss>