<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[mwhybmj的博客]]></title><description><![CDATA[1]]></description><link>https://blog.csdn.net/tigercoder</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; tigercoder]]></copyright><item><title><![CDATA[Find a way HDU - 2612]]></title><link>https://blog.csdn.net/tigercoder/article/details/72760501</link><guid>https://blog.csdn.net/tigercoder/article/details/72760501</guid><author>tigercoder</author><pubDate>Fri, 26 May 2017 00:00:02 +0800</pubDate><description><![CDATA[Pass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. Leave Ningbo one year, yifenfei have many people to meet. Especially a good friend Merceki. 
Yifenfei’s home is at the c]]></description><category></category></item><item><title><![CDATA[敌兵布阵 HDU - 1166    easy]]></title><link>https://blog.csdn.net/tigercoder/article/details/72758414</link><guid>https://blog.csdn.net/tigercoder/article/details/72758414</guid><author>tigercoder</author><pubDate>Thu, 25 May 2017 22:22:36 +0800</pubDate><description><![CDATA[C国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段，所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人数都有可能发生变动，可能增加或减少若干人手,但这些都逃不过C国的监视。 
中央情报局要研究敌人究竟演习什么战术,]]></description><category></category></item><item><title><![CDATA[非常可乐 HDU - 1495]]></title><link>https://blog.csdn.net/tigercoder/article/details/72745132</link><guid>https://blog.csdn.net/tigercoder/article/details/72745132</guid><author>tigercoder</author><pubDate>Thu, 25 May 2017 20:20:01 +0800</pubDate><description><![CDATA[大家一定觉的运动以后喝可乐是一件很惬意的事情，但是seeyou却不这么认为。因为每次当seeyou买了可乐以后，阿牛就要求和seeyou一起分享这一瓶可乐，而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子，它们的容量分别是N 毫升和M 毫升 可乐的体积为S （S

Input三个整数 : S 可乐的体积 , N 和 M是两个杯子的容量，以"0 0 0"结束。
Output]]></description><category></category></item><item><title><![CDATA[Zjnu Stadium HDU - 3047    带权并查集]]></title><link>https://blog.csdn.net/tigercoder/article/details/72697506</link><guid>https://blog.csdn.net/tigercoder/article/details/72697506</guid><author>tigercoder</author><pubDate>Wed, 24 May 2017 19:31:48 +0800</pubDate><description><![CDATA[In 12th Zhejiang College Students Games 2007, there was a new stadium built in Zhejiang Normal University. It was a modern stadium which could hold thousands of people. The audience Seats made a circl]]></description><category></category></item><item><title><![CDATA[Fire! UVA - 11624]]></title><link>https://blog.csdn.net/tigercoder/article/details/72566141</link><guid>https://blog.csdn.net/tigercoder/article/details/72566141</guid><author>tigercoder</author><pubDate>Fri, 19 May 2017 21:25:15 +0800</pubDate><description><![CDATA[https://vjudge.net/problem/UVA-11624







#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
const int INF = 0x3f3f3f3f;]]></description><category></category></item><item><title><![CDATA[Just a Hook HDU - 1698  区间更新（直接改）]]></title><link>https://blog.csdn.net/tigercoder/article/details/72510777</link><guid>https://blog.csdn.net/tigercoder/article/details/72510777</guid><author>tigercoder</author><pubDate>Thu, 18 May 2017 21:57:33 +0800</pubDate><description><![CDATA[In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks which are of the same length. 




No]]></description><category></category></item><item><title><![CDATA[Lazy Propagating  52C - Circular RMQ 标准模板题]]></title><link>https://blog.csdn.net/tigercoder/article/details/72455398</link><guid>https://blog.csdn.net/tigercoder/article/details/72455398</guid><author>tigercoder</author><pubDate>Wed, 17 May 2017 23:48:02 +0800</pubDate><description><![CDATA[C. Circular RMQ


time limit per test
3 seconds


memory limit per test
256 megabytes


input
standard input


output
standard output



You are given circular array a0, a1, ..., a]]></description><category></category></item><item><title><![CDATA[线段树入门第一题！  I Hate It HDU - 1754]]></title><link>https://blog.csdn.net/tigercoder/article/details/72417114</link><guid>https://blog.csdn.net/tigercoder/article/details/72417114</guid><author>tigercoder</author><pubDate>Wed, 17 May 2017 17:37:19 +0800</pubDate><description><![CDATA[很多学校流行一种比较的习惯。老师们很喜欢询问，从某某到某某当中，分数最高的是多少。 
这让很多学生很反感。 

不管你喜不喜欢，现在需要你做的是，就是按照老师的要求，写一个程序，模拟老师的询问。当然，老师有时候需要更新某位同学的成绩。

Input本题目包含多组测试，请处理到文件结束。 
在每个测试的第一行，有两个正整数 N 和 M ( 0
学生ID编号分别从1编到N。 
第二行包]]></description><category></category></item><item><title><![CDATA[segment tree template]]></title><link>https://blog.csdn.net/tigercoder/article/details/72354155</link><guid>https://blog.csdn.net/tigercoder/article/details/72354155</guid><author>tigercoder</author><pubDate>Tue, 16 May 2017 22:47:55 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
const int INF = 0x3f3f3f3f;
const int NINF = 0xc0c0c0c0;
typedef long long ll;
c]]></description><category></category></item><item><title><![CDATA[segment tree cf197D  Xenia and Bit Operations]]></title><link>https://blog.csdn.net/tigercoder/article/details/72353722</link><guid>https://blog.csdn.net/tigercoder/article/details/72353722</guid><author>tigercoder</author><pubDate>Tue, 16 May 2017 22:02:29 +0800</pubDate><description><![CDATA[D. Xenia and Bit Operations


time limit per test
2 seconds


memory limit per test
256 megabytes


input
standard input


output
standard output



Xenia the beginner programmer h]]></description><category></category></item><item><title><![CDATA[带权并查集 shuoj1880]]></title><link>https://blog.csdn.net/tigercoder/article/details/72322310</link><guid>https://blog.csdn.net/tigercoder/article/details/72322310</guid><author>tigercoder</author><pubDate>Tue, 16 May 2017 18:19:27 +0800</pubDate><description><![CDATA[1880: 等级森严
Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 129  Solved: 19
[Submit][Status][Web
 Board]

Description


武林，当然有拉帮结派，帮派之间还有吞并现象。那么两个人见面，常常要问，咱俩是自己人吗？如果是自己人，他们还想知道他们两个人的等级差多少。你需要做]]></description><category></category></item><item><title><![CDATA[Fire Game FZU - 2150]]></title><link>https://blog.csdn.net/tigercoder/article/details/72084700</link><guid>https://blog.csdn.net/tigercoder/article/details/72084700</guid><author>tigercoder</author><pubDate>Sun, 14 May 2017 23:41:38 +0800</pubDate><description><![CDATA[Fat brother and Maze are playing a kind of special (hentai) game on an N*M board (N rows, M columns). At the beginning, each grid of this board is consisting of grass or just empty and then they start]]></description><category></category></item><item><title><![CDATA[priority_queue practice]]></title><link>https://blog.csdn.net/tigercoder/article/details/71791327</link><guid>https://blog.csdn.net/tigercoder/article/details/71791327</guid><author>tigercoder</author><pubDate>Sat, 13 May 2017 11:29:12 +0800</pubDate><description><![CDATA[https://vjudge.net/problem/POJ-2431


http://stackoverflow.com/questions/15601973/stl-priority-queue-of-c-with-struct



#include
#include
#include
#include
#include
#include
#include
#include]]></description><category></category></item><item><title><![CDATA[problem]]></title><link>https://blog.csdn.net/tigercoder/article/details/71774155</link><guid>https://blog.csdn.net/tigercoder/article/details/71774155</guid><author>tigercoder</author><pubDate>Fri, 12 May 2017 22:57:31 +0800</pubDate><description><![CDATA[http://acm.ecnu.edu.cn/problem/3260/


http://acm.ecnu.edu.cn/problem/3263/]]></description><category></category></item><item><title><![CDATA[A. 拼音魔法  ecnu]]></title><link>https://blog.csdn.net/tigercoder/article/details/71773888</link><guid>https://blog.csdn.net/tigercoder/article/details/71773888</guid><author>tigercoder</author><pubDate>Fri, 12 May 2017 22:07:52 +0800</pubDate><description><![CDATA[Time limit per test: 1.0 seconds

Time limit all tests: 1.0 seconds

Memory limit: 256 megabytes

Accept / Submit: 341 / 2134




魔法学校小学一年级有一种题。就是给一个字的拼音，给一个声调，让你正确地注音。但魔法老师给了巨量的题，你不用魔法根本不可]]></description><category></category></item><item><title><![CDATA[背包集合]]></title><link>https://blog.csdn.net/tigercoder/article/details/71699179</link><guid>https://blog.csdn.net/tigercoder/article/details/71699179</guid><author>tigercoder</author><pubDate>Thu, 11 May 2017 23:05:23 +0800</pubDate><description><![CDATA[https://vjudge.net/problem/HDU-2191










#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
const int INF = 0x3f3f3]]></description><category></category></item><item><title><![CDATA[poj3414 pots 倒水模拟]]></title><link>https://blog.csdn.net/tigercoder/article/details/71597871</link><guid>https://blog.csdn.net/tigercoder/article/details/71597871</guid><author>tigercoder</author><pubDate>Wed, 10 May 2017 21:55:25 +0800</pubDate><description><![CDATA[You are given two pots, having the volume of A and B liters respectively. The following operations can be performed:

FILL(i)        fill the pot i (1 ≤ i ≤ 2) from the tap;DROP(i)      empty the po]]></description><category></category></item><item><title><![CDATA[FFT]]></title><link>https://blog.csdn.net/tigercoder/article/details/71512905</link><guid>https://blog.csdn.net/tigercoder/article/details/71512905</guid><author>tigercoder</author><pubDate>Tue, 09 May 2017 23:12:51 +0800</pubDate><description><![CDATA[http://202.121.199.212/JudgeOnline/problem.php?id=1966






#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
const int IN]]></description><category></category></item><item><title><![CDATA[Shuffle'm Up POJ - 3087]]></title><link>https://blog.csdn.net/tigercoder/article/details/71375764</link><guid>https://blog.csdn.net/tigercoder/article/details/71375764</guid><author>tigercoder</author><pubDate>Sun, 07 May 2017 23:17:33 +0800</pubDate><description><![CDATA[A common pastime for poker players at a poker table is to shuffle stacks of chips. Shuffling chips is performed by starting with two stacks of poker chips, S1 and S2, each stack containing C chips.]]></description><category></category></item><item><title><![CDATA[Sort    归并排序求逆序对]]></title><link>https://blog.csdn.net/tigercoder/article/details/71375485</link><guid>https://blog.csdn.net/tigercoder/article/details/71375485</guid><author>tigercoder</author><pubDate>Sun, 07 May 2017 23:14:21 +0800</pubDate><description><![CDATA[Time limit per test: 4.0 seconds
Time limit all tests: 4.0 seconds
Memory limit: 256 megabytes




You want to process a sequence of n distinct
 integers by swapping two adjacent sequence elem]]></description><category></category></item></channel></rss>