<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[oyasherkin的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/oyasherkin</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; oyasherkin]]></copyright><item><title><![CDATA[1006 Sign In and Sign Out （25 分）]]></title><link>https://blog.youkuaiyun.com/oyasherkin/article/details/87210495</link><guid>https://blog.youkuaiyun.com/oyasherkin/article/details/87210495</guid><author>oyasherkin</author><pubDate>Wed, 13 Feb 2019 21:47:49 +0800</pubDate><description><![CDATA[
#include &amp;lt;iostream&amp;gt;
#include &amp;lt;algorithm&amp;gt;
#include &amp;lt;cstdio&amp;gt;
#include &amp;lt;vector&amp;gt;
#include &amp;lt;cstring&amp;gt;
#include &amp;lt;string&amp;gt;
using namespace std;
const int inf = 0x3fffffff;
...]]></description><category></category></item><item><title><![CDATA[1005 Spell It Right （20 分）]]></title><link>https://blog.youkuaiyun.com/oyasherkin/article/details/87209339</link><guid>https://blog.youkuaiyun.com/oyasherkin/article/details/87209339</guid><author>oyasherkin</author><pubDate>Wed, 13 Feb 2019 21:30:13 +0800</pubDate><description><![CDATA[
#include &amp;lt;iostream&amp;gt;
#include &amp;lt;algorithm&amp;gt;
#include &amp;lt;cstdio&amp;gt;
#include &amp;lt;vector&amp;gt;
#include &amp;lt;cstring&amp;gt;
#include &amp;lt;string&amp;gt;
using namespace std;
const int inf = 0x3fffffff;
...]]></description><category></category></item><item><title><![CDATA[1004 Counting Leaves （30 分）]]></title><link>https://blog.youkuaiyun.com/oyasherkin/article/details/87206848</link><guid>https://blog.youkuaiyun.com/oyasherkin/article/details/87206848</guid><author>oyasherkin</author><pubDate>Wed, 13 Feb 2019 20:52:37 +0800</pubDate><description><![CDATA[思路：并查集，建立家谱树，用数组root[]存储， used[]记录非叶节点，然后dfs查找每个节点的rank[]， 查找过程可剪枝， 最后排序输出。


#include &amp;lt;iostream&amp;gt;
#include &amp;lt;algorithm&amp;gt;
#include &amp;lt;cstdio&amp;gt;
#include &amp;lt;vector&amp;gt;
#include &amp;lt;cstring&amp;...]]></description><category></category></item><item><title><![CDATA[1003 Emergency （25 分）]]></title><link>https://blog.youkuaiyun.com/oyasherkin/article/details/87186918</link><guid>https://blog.youkuaiyun.com/oyasherkin/article/details/87186918</guid><author>oyasherkin</author><pubDate>Wed, 13 Feb 2019 16:02:04 +0800</pubDate><description><![CDATA[
#include &amp;lt;iostream&amp;gt;
#include &amp;lt;algorithm&amp;gt;
#include &amp;lt;cstdio&amp;gt;
#include &amp;lt;vector&amp;gt;
#include &amp;lt;cstring&amp;gt;
#include &amp;lt;string&amp;gt;
using namespace std;
const int inf = 0x3fffffff;
...]]></description><category></category></item><item><title><![CDATA[1060 爱丁顿数 （25 分）]]></title><link>https://blog.youkuaiyun.com/oyasherkin/article/details/86846765</link><guid>https://blog.youkuaiyun.com/oyasherkin/article/details/86846765</guid><author>oyasherkin</author><pubDate>Sat, 09 Feb 2019 23:17:08 +0800</pubDate><description><![CDATA[
#include&amp;lt;iostream&amp;gt;
#include&amp;lt;cstdio&amp;gt;
#include&amp;lt;cstring&amp;gt;
#include&amp;lt;cctype&amp;gt;
#include&amp;lt;cmath&amp;gt;
#include&amp;lt;algorithm&amp;gt;
#include&amp;lt;map&amp;gt;
using namespace std;

int cmp(int a,]]></description><category></category></item><item><title><![CDATA[1059 C语言竞赛 （20 分）]]></title><link>https://blog.youkuaiyun.com/oyasherkin/article/details/86845809</link><guid>https://blog.youkuaiyun.com/oyasherkin/article/details/86845809</guid><author>oyasherkin</author><pubDate>Sat, 09 Feb 2019 23:02:59 +0800</pubDate><description><![CDATA[
#include&amp;lt;iostream&amp;gt;
#include&amp;lt;cstdio&amp;gt;
#include&amp;lt;cstring&amp;gt;
#include&amp;lt;cctype&amp;gt;
#include&amp;lt;cmath&amp;gt;
#include&amp;lt;algorithm&amp;gt;
#include&amp;lt;map&amp;gt;
using namespace std;

int isPrime(in]]></description><category></category></item><item><title><![CDATA[1058 选择题 （20 分）]]></title><link>https://blog.youkuaiyun.com/oyasherkin/article/details/86841155</link><guid>https://blog.youkuaiyun.com/oyasherkin/article/details/86841155</guid><author>oyasherkin</author><pubDate>Sat, 09 Feb 2019 21:53:24 +0800</pubDate><description><![CDATA[
#include&amp;lt;iostream&amp;gt;
#include&amp;lt;cstdio&amp;gt;
#include&amp;lt;cstring&amp;gt;
#include&amp;lt;cctype&amp;gt;
#include&amp;lt;cmath&amp;gt;
#include&amp;lt;algorithm&amp;gt;
#include&amp;lt;map&amp;gt;
using namespace std;

int main(){
  ]]></description><category></category></item><item><title><![CDATA[1055 集体照 （25 分）]]></title><link>https://blog.youkuaiyun.com/oyasherkin/article/details/86829711</link><guid>https://blog.youkuaiyun.com/oyasherkin/article/details/86829711</guid><author>oyasherkin</author><pubDate>Sat, 09 Feb 2019 19:03:24 +0800</pubDate><description><![CDATA[ 若name用char型，记得用 getchar()吸收换行符，用char卡了三小时，改成string立马过了= =


#include&amp;lt;iostream&amp;gt;
#include&amp;lt;cstdio&amp;gt;
#include&amp;lt;cstring&amp;gt;
#include&amp;lt;cctype&amp;gt;
#include&amp;lt;cmath&amp;gt;
#include&amp;lt;algorithm&amp;...]]></description><category></category></item><item><title><![CDATA[PTA_B_1054 求平均值 （20 分）]]></title><link>https://blog.youkuaiyun.com/oyasherkin/article/details/86814586</link><guid>https://blog.youkuaiyun.com/oyasherkin/article/details/86814586</guid><author>oyasherkin</author><pubDate>Sat, 09 Feb 2019 15:15:23 +0800</pubDate><description><![CDATA[
#include&amp;lt;iostream&amp;gt;
#include&amp;lt;cstdio&amp;gt;
#include&amp;lt;cstring&amp;gt;
#include&amp;lt;cctype&amp;gt;
#include&amp;lt;cmath&amp;gt;
#include&amp;lt;algorithm&amp;gt;
#include&amp;lt;map&amp;gt;
using namespace std;

double num = 0]]></description><category></category></item><item><title><![CDATA[图论小结]]></title><link>https://blog.youkuaiyun.com/oyasherkin/article/details/76100581</link><guid>https://blog.youkuaiyun.com/oyasherkin/article/details/76100581</guid><author>oyasherkin</author><pubDate>Wed, 26 Jul 2017 00:21:06 +0800</pubDate><description><![CDATA[BellmanFord\dijkstra\堆优化\FloydWarshall\prime\kruskal算法的简单实现//图的表示
const int maxv = 1e5;
//struct Edge{ int to, cost; };
//vector<Edge> G[maxv];
vector<int> G[maxv];
int main()
{
    int v, e;
    scanf]]></description><category></category></item><item><title><![CDATA[并查集简单实现]]></title><link>https://blog.youkuaiyun.com/oyasherkin/article/details/75808305</link><guid>https://blog.youkuaiyun.com/oyasherkin/article/details/75808305</guid><author>oyasherkin</author><pubDate>Sat, 22 Jul 2017 23:31:22 +0800</pubDate><description><![CDATA[const int maxn = 50010;
int root[maxn];//父亲
int rank[maxn];//数的高度
int n;//初始化n个元素
void init(){
    for(int i = 0; i < n; i++){
        root[i] = i;
        rank[i] = 0;
    }
}//查询树的根
int find(int x){]]></description><category></category></item><item><title><![CDATA[binarySearchTree 简单链表实现]]></title><link>https://blog.youkuaiyun.com/oyasherkin/article/details/75801654</link><guid>https://blog.youkuaiyun.com/oyasherkin/article/details/75801654</guid><author>oyasherkin</author><pubDate>Sat, 22 Jul 2017 19:08:32 +0800</pubDate><description><![CDATA[//binarySearchTree
struct node{
    int val;
    node *lson, *rson;
}node* insert(node *p, int x){
    if(p == null){
        node *q = new node;
        q->val = x;
        q->lson = q->rson = null;]]></description><category></category></item><item><title><![CDATA[HDU1026  Ignatius and the Princess I(BFS)]]></title><link>https://blog.youkuaiyun.com/oyasherkin/article/details/75730217</link><guid>https://blog.youkuaiyun.com/oyasherkin/article/details/75730217</guid><author>oyasherkin</author><pubDate>Sat, 22 Jul 2017 13:32:10 +0800</pubDate><description><![CDATA[Problem Description 
The Princess has been abducted by the BEelzebub feng5166, our hero Ignatius has to rescue our pretty Princess. Now he gets into feng5166’s castle. The castle is a large labyrinth.]]></description><category></category></item><item><title><![CDATA[HDU3152 Obstacle Course(BFS)]]></title><link>https://blog.youkuaiyun.com/oyasherkin/article/details/75675875</link><guid>https://blog.youkuaiyun.com/oyasherkin/article/details/75675875</guid><author>oyasherkin</author><pubDate>Fri, 21 Jul 2017 23:48:53 +0800</pubDate><description><![CDATA[Problem Description 
You are working on the team assisting with programming for the Mars rover. To conserve energy, the rover needs to find optimal paths across the rugged terrain to get from its start]]></description><category></category></item><item><title><![CDATA[HDU1678  Shopaholic]]></title><link>https://blog.youkuaiyun.com/oyasherkin/article/details/75675728</link><guid>https://blog.youkuaiyun.com/oyasherkin/article/details/75675728</guid><author>oyasherkin</author><pubDate>Fri, 21 Jul 2017 23:18:08 +0800</pubDate><description><![CDATA[ShopaholicProblem Description 
Lindsay is a shopaholic. Whenever there is a discount of the kind where you can buy three items and only pay for two, she goes completely mad and feels a need to buy all]]></description><category></category></item><item><title><![CDATA[HDU4006 The kth great number(优先队列)]]></title><link>https://blog.youkuaiyun.com/oyasherkin/article/details/75675653</link><guid>https://blog.youkuaiyun.com/oyasherkin/article/details/75675653</guid><author>oyasherkin</author><pubDate>Fri, 21 Jul 2017 23:00:59 +0800</pubDate><description><![CDATA[Problem Description 
Xiao Ming and Xiao Bao are playing a simple Numbers game. In a round Xiao Ming can choose to write down a number, or ask Xiao Bao what the kth great number is. Because the number w]]></description><category></category></item><item><title><![CDATA[HDU1180 诡异的楼梯(BFS)]]></title><link>https://blog.youkuaiyun.com/oyasherkin/article/details/75670050</link><guid>https://blog.youkuaiyun.com/oyasherkin/article/details/75670050</guid><author>oyasherkin</author><pubDate>Fri, 21 Jul 2017 18:27:33 +0800</pubDate><description><![CDATA[Problem Description  
Hogwarts正式开学以后,Harry发现在Hogwarts里,某些楼梯并不是静止不动的，相反,他们每隔一分钟就变动一次方向.  
比如下面的例子里,一开始楼梯在竖直方向,一分钟以后它移动到了水平方向,再过一分钟它又回到了竖直方向.Harry发现对他来说很难找到能使得他最快到达目的地的路线,这时Ron(Harry最好的朋友)告诉Harry正好有一个魔法道]]></description><category></category></item><item><title><![CDATA[HDU1434 幸福列车（优先队列）]]></title><link>https://blog.youkuaiyun.com/oyasherkin/article/details/75643913</link><guid>https://blog.youkuaiyun.com/oyasherkin/article/details/75643913</guid><author>oyasherkin</author><pubDate>Fri, 21 Jul 2017 14:07:40 +0800</pubDate><description><![CDATA[Problem Description 
一批幸福的列车即将从杭州驶向幸福的终点站——温州，身为总列车长的linle有一些奇怪的癖好。他会记录下全部乘客的名字（name）和他们的人品值（RP），根据这些将他们排序，并不时地从某辆列车里踢出人品最不好（RP值最低）的一个人，当两个人人品一样不好时，他就会踢出名字难听的人（linle认为按字典顺序，排在越在后面的人名字越难听）。当然出于列车行驶需要，他还]]></description><category></category></item><item><title><![CDATA[HDU1873  看病要排队（优先队列）]]></title><link>https://blog.youkuaiyun.com/oyasherkin/article/details/75639738</link><guid>https://blog.youkuaiyun.com/oyasherkin/article/details/75639738</guid><author>oyasherkin</author><pubDate>Fri, 21 Jul 2017 13:24:22 +0800</pubDate><description><![CDATA[看病要排队看病要排队这个是地球人都知道的常识。 
不过经过细心的0068的观察，他发现了医院里排队还是有讲究的。0068所去的医院有三个医生（汗，这么少）同时看病。而看病的人病情有轻重，所以不能根据简单的先来先服务的原则。所以医院对每种病情规定了10种不同的优先级。级别为10的优先权最高，级别为1的优先权最低。医生在看病时，则会在他的队伍里面选择一个优先权最高的人进行诊治。如果遇到两个优先权一样的病]]></description><category></category></item><item><title><![CDATA[HDU 1689 Just a HooK(线段树+延迟标记)]]></title><link>https://blog.youkuaiyun.com/oyasherkin/article/details/75434861</link><guid>https://blog.youkuaiyun.com/oyasherkin/article/details/75434861</guid><author>oyasherkin</author><pubDate>Wed, 19 Jul 2017 18:40:06 +0800</pubDate><description><![CDATA[Just a Hook 
Time Limit : 4000/2000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other) 
Total Submission(s) : 0   Accepted Submission(s) : 0 
Font: Times New Roman | Verdana | Georgia 
Font Size]]></description><category></category></item></channel></rss>