<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[烟火]]></title><description><![CDATA[没有什么比时间更有说服力了，时间无需通知我们就可以改变一切。]]></description><link>https://blog.youkuaiyun.com/RRicky_</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; RRicky_]]></copyright><item><title><![CDATA[[cout]]]></title><link>https://blog.youkuaiyun.com/RRicky_/article/details/78516001</link><guid>https://blog.youkuaiyun.com/RRicky_/article/details/78516001</guid><author>RRicky_</author><pubDate>Sun, 12 Nov 2017 22:47:36 +0800</pubDate><description><![CDATA[输出，格式为cout<<n;
如果你想隔行输入的话，用cout<<n<<endl;
如果你想空格的话为cout<<n1<<" "<<n2;
要输出变量话需要提前定义，不是变量的话，要加引号，如cout<<"Hello,World!"<<endl;]]></description><category></category></item><item><title><![CDATA[【HPU1194】Judge [快速幂]]]></title><link>https://blog.youkuaiyun.com/RRicky_/article/details/77459257</link><guid>https://blog.youkuaiyun.com/RRicky_/article/details/77459257</guid><author>RRicky_</author><pubDate>Mon, 21 Aug 2017 20:41:55 +0800</pubDate><description><![CDATA[http://acm.hpu.edu.cn/problem.php?id=11941194: Judge [快速幂] 
时间限制: 1 Sec 内存限制: 128 MB提交: 1266 解决: 176 统计 
题目描述 
Ocean从影视城回来后，吃了一个放大果实（恶魔果实的一种），高呼：“海贼王に、俺はなる！”Ocean每使用一次能力，就可以将一个物品的价值放大xx倍（原价值乘以xx）。 
但是哪]]></description><category></category></item><item><title><![CDATA[【HPU1189】Ou à [数学]]]></title><link>https://blog.youkuaiyun.com/RRicky_/article/details/77458800</link><guid>https://blog.youkuaiyun.com/RRicky_/article/details/77458800</guid><author>RRicky_</author><pubDate>Mon, 21 Aug 2017 20:39:54 +0800</pubDate><description><![CDATA[http://acm.hpu.edu.cn/problem.php?id=11891189: Ou à [数学] 
时间限制: 1 Sec 内存限制: 128 MB提交: 440 解决: 281 统计 
题目描述 
Ou à是什么东东？华丽的分割线？233333……Ocean的小学弟学习了新的二进制运算异或”^”。对于0、10、1二进制位而言，异或运算结果如下：0 ^ 0 = 0，0 ^ 1 = 1]]></description><category></category></item><item><title><![CDATA[【POJ3041】Asteroids（二分图）]]></title><link>https://blog.youkuaiyun.com/RRicky_/article/details/77430766</link><guid>https://blog.youkuaiyun.com/RRicky_/article/details/77430766</guid><author>RRicky_</author><pubDate>Sun, 20 Aug 2017 17:46:26 +0800</pubDate><description><![CDATA[http://poj.org/problem?id=3041Asteroids 
Time Limit: 1000MS      Memory Limit: 65536K 
Total Submissions: 23472        Accepted: 12739 
DescriptionBessie wants to navigate her spaceship through a dange]]></description><category></category></item><item><title><![CDATA[【HDU1068】Girls and Boys（最大独立集数，匈牙利算法）]]></title><link>https://blog.youkuaiyun.com/RRicky_/article/details/77430745</link><guid>https://blog.youkuaiyun.com/RRicky_/article/details/77430745</guid><author>RRicky_</author><pubDate>Sun, 20 Aug 2017 17:44:03 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=1068Girls and BoysTime Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) 
Total Submission(s): 12150    Accepted Submission(s):]]></description><category></category></item><item><title><![CDATA[【HDU2063】过山车（二分图最大匹配，匈牙利算法）]]></title><link>https://blog.youkuaiyun.com/RRicky_/article/details/77430731</link><guid>https://blog.youkuaiyun.com/RRicky_/article/details/77430731</guid><author>RRicky_</author><pubDate>Sun, 20 Aug 2017 17:41:59 +0800</pubDate><description><![CDATA[http://acm.hdu.edu.cn/showproblem.php?pid=2063过山车Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) 
Total Submission(s): 23810    Accepted Submission(s): 10371Problem]]></description><category></category></item><item><title><![CDATA[【unique函数】]]></title><link>https://blog.youkuaiyun.com/RRicky_/article/details/77411139</link><guid>https://blog.youkuaiyun.com/RRicky_/article/details/77411139</guid><author>RRicky_</author><pubDate>Sat, 19 Aug 2017 12:33:10 +0800</pubDate><description><![CDATA[unique()函数：是一个去重函数，STL中unique的函数 unique的功能是去除相邻的重复元素(只保留一个),还有一个容易忽视的特性是它并不真正把重复的元素删除。头文件：#include<algorithm>
using namespace std;unique(num,mun+n)它并不真正把重复的元素删除，该函数是把重复的元素移到后面去了，然后依然保存到了原数组中，因为unique去除]]></description><category></category></item><item><title><![CDATA[【GJJ的日常之再游戏】（数组排序去重）]]></title><link>https://blog.youkuaiyun.com/RRicky_/article/details/77410878</link><guid>https://blog.youkuaiyun.com/RRicky_/article/details/77410878</guid><author>RRicky_</author><pubDate>Sat, 19 Aug 2017 12:16:12 +0800</pubDate><description><![CDATA[题：https://acm.zzuli.edu.cn/zzuliacm/problem.php?cid=1242&pid=0Problem A: GJJ的日常之再游戏Time Limit: 1 Sec  Memory Limit: 128 MB 
Submit: 844  Solved: 179SubmitWeb Board 
DescriptionGJJ和WJJ又开始了游戏，然而由于WJJ太强了，]]></description><category></category></item><item><title><![CDATA[【HDU1556】Color the ball（树状数组）]]></title><link>https://blog.youkuaiyun.com/RRicky_/article/details/77340969</link><guid>https://blog.youkuaiyun.com/RRicky_/article/details/77340969</guid><author>RRicky_</author><pubDate>Thu, 17 Aug 2017 20:46:33 +0800</pubDate><description><![CDATA[题：http://acm.hdu.edu.cn/showproblem.php?pid=1556 
Color the ballTime Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) 
Total Submission(s): 23119    Accepted Submission(s)]]></description><category></category></item><item><title><![CDATA[【HDU1166】敌兵布阵（树状数组）]]></title><link>https://blog.youkuaiyun.com/RRicky_/article/details/77337216</link><guid>https://blog.youkuaiyun.com/RRicky_/article/details/77337216</guid><author>RRicky_</author><pubDate>Thu, 17 Aug 2017 17:47:26 +0800</pubDate><description><![CDATA[题：http://acm.hdu.edu.cn/showproblem.php?pid=1166敌兵布阵Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) 
Total Submission(s): 97874    Accepted Submission(s): 41415Probl]]></description><category></category></item><item><title><![CDATA[【HDU1754】I Hate It（线段树）]]></title><link>https://blog.youkuaiyun.com/RRicky_/article/details/77337112</link><guid>https://blog.youkuaiyun.com/RRicky_/article/details/77337112</guid><author>RRicky_</author><pubDate>Thu, 17 Aug 2017 17:40:48 +0800</pubDate><description><![CDATA[题：http://acm.hdu.edu.cn/showproblem.php?pid=1754I Hate ItTime Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) 
Total Submission(s): 82147    Accepted Submission(s): 31582]]></description><category></category></item><item><title><![CDATA[【树状数组】]]></title><link>https://blog.youkuaiyun.com/RRicky_/article/details/77336601</link><guid>https://blog.youkuaiyun.com/RRicky_/article/details/77336601</guid><author>RRicky_</author><pubDate>Thu, 17 Aug 2017 17:30:10 +0800</pubDate><description><![CDATA[树状数组： 
树状数组是一个查询和修改复杂度都为log(n)的数据结构。主要用于查询任意两位之间的所有元素之和，但是每次只能修改一个元素的值；经过简单修改可以在log(n)的复杂度下进行范围修改，但是这时只能查询其中一个元素的值。 
树状数组和线段树很像，但能用树状数组解决的问题，基本上都能用线段树解决，而线段树能解决的树状数组不一定能解决。相比较而言，树状数组效率要高很多。 
区别： 
1.线段数]]></description><category></category></item><item><title><![CDATA[【I♡U】]]></title><link>https://blog.youkuaiyun.com/RRicky_/article/details/77199419</link><guid>https://blog.youkuaiyun.com/RRicky_/article/details/77199419</guid><author>RRicky_</author><pubDate>Tue, 15 Aug 2017 20:14:53 +0800</pubDate><description><![CDATA[#include <stdio.h>
#include <windows.h>
#define N 50
HANDLE hConsole;
void gotoxy(int x, int y)
{
    COORD coord;
    coord.X = x;
    coord.Y = y;
    SetConsoleCursorPosition(hConsole, coord);
}
int]]></description><category></category></item><item><title><![CDATA[【KMP算法】]]></title><link>https://blog.youkuaiyun.com/RRicky_/article/details/77195725</link><guid>https://blog.youkuaiyun.com/RRicky_/article/details/77195725</guid><author>RRicky_</author><pubDate>Tue, 15 Aug 2017 15:57:42 +0800</pubDate><description><![CDATA[http://www.61mon.com/index.php/archives/183/http://www.cnblogs.com/dolphin0520/archive/2011/08/24/2151846.htmlhttp://www.matrix67.com/blog/archives/115http://www.cnblogs.com/yjiyjige/p/3263858.html#337]]></description><category></category></item><item><title><![CDATA[【HPUvjudge】矩阵乘法]]></title><link>https://blog.youkuaiyun.com/RRicky_/article/details/77163695</link><guid>https://blog.youkuaiyun.com/RRicky_/article/details/77163695</guid><author>RRicky_</author><pubDate>Mon, 14 Aug 2017 16:56:00 +0800</pubDate><description><![CDATA[http://acm.hpu.edu.cn/vjudge/contest/view.action?cid=7#problem/BB - 矩阵乘法 
Time Limit:1000MS     Memory Limit:131072KB     64bit IO Format:%lld & %llu 
SubmitStatus 
Description 
给定两个矩阵AA和BB，你需要判断它们是否可以]]></description><category></category></item><item><title><![CDATA[【快速幂】【快速幂取模】]]></title><link>https://blog.youkuaiyun.com/RRicky_/article/details/77161956</link><guid>https://blog.youkuaiyun.com/RRicky_/article/details/77161956</guid><author>RRicky_</author><pubDate>Mon, 14 Aug 2017 15:13:59 +0800</pubDate><description><![CDATA[原文：http://www.cnblogs.com/CXCXCXC/p/4641812.html快速幂这个东西比较好理解，但实现起来到不老好办，记了几次老是忘，今天把它系统的总结一下防止忘记。　　首先，快速幂的目的就是做到快速求幂，假设我们要求a^b,按照朴素算法就是把a连乘b次，这样一来时间复杂度是O(b)也即是O(n)级别，快速幂能做到O(logn)，快了好多好多。它的原理如下：　　假设我们要求]]></description><category></category></item><item><title><![CDATA[【floor函数】【ceil函数】]]></title><link>https://blog.youkuaiyun.com/RRicky_/article/details/77129700</link><guid>https://blog.youkuaiyun.com/RRicky_/article/details/77129700</guid><author>RRicky_</author><pubDate>Sat, 12 Aug 2017 20:26:12 +0800</pubDate><description><![CDATA[floor函数： 
floor(x),有时候也写做Floor(x)，其功能是“向下取整”，或者说“向下舍入”，即取不大于x的最大整数（与“四舍五入”不同，下取整是直接取按照数轴上最接近要求的值左边的值，也就是不大于要求的值的最大的那个）。 
头文件：#include < math.h>例如： 
x = 6.04; 
y = floor( x ); 
y的值为6.0.与floor函数对应的是ceil函]]></description><category></category></item><item><title><![CDATA[【HPU1412】 QAQ & 君临天下 || 天行九歌 (区间)]]></title><link>https://blog.youkuaiyun.com/RRicky_/article/details/77129574</link><guid>https://blog.youkuaiyun.com/RRicky_/article/details/77129574</guid><author>RRicky_</author><pubDate>Sat, 12 Aug 2017 20:11:19 +0800</pubDate><description><![CDATA[题：http://acm.hpu.edu.cn/problem.php?id=14121412: QAQ & 君临天下 || 天行九歌 [区间] 
时间限制: 1 Sec 内存限制: 128 MB提交: 771 解决: 240 统计 
题目描述 
QAQ~生活之余喜欢看一些动漫，说到国产动漫，QAQ 最喜欢的就属玄机了，玄机出品的动漫都很赞的说，君临天下 和 天行九歌是 QAQ 最喜欢的两部动漫了，]]></description><category></category></item><item><title><![CDATA[【南阳OJ119】士兵杀敌（三）（线段树）]]></title><link>https://blog.youkuaiyun.com/RRicky_/article/details/77126936</link><guid>https://blog.youkuaiyun.com/RRicky_/article/details/77126936</guid><author>RRicky_</author><pubDate>Sat, 12 Aug 2017 18:47:43 +0800</pubDate><description><![CDATA[士兵杀敌三士兵杀敌（三） 
时间限制：2000 ms  |  内存限制：65535 KB 
难度：5 
描述 
南将军统率着N个士兵，士兵分别编号为1~N,南将军经常爱拿某一段编号内杀敌数最高的人与杀敌数最低的人进行比较，计算出两个人的杀敌数差值，用这种方法一方面能鼓舞杀敌数高的人，另一方面也算是批评杀敌数低的人，起到了很好的效果。所以，南将军经常问军师小工第i号士兵到第j号士兵中，杀敌数最高的人与]]></description><category></category></item><item><title><![CDATA[【南阳OJ116】士兵杀敌（二）（线段树）]]></title><link>https://blog.youkuaiyun.com/RRicky_/article/details/77126896</link><guid>https://blog.youkuaiyun.com/RRicky_/article/details/77126896</guid><author>RRicky_</author><pubDate>Sat, 12 Aug 2017 18:41:41 +0800</pubDate><description><![CDATA[士兵杀敌二士兵杀敌（二） 
时间限制：1000 ms  |  内存限制：65535 KB 
难度：5 
描述 
南将军手下有N个士兵，分别编号1到N，这些士兵的杀敌数都是已知的。小工是南将军手下的军师，南将军经常想知道第m号到第n号士兵的总杀敌数，请你帮助小工来回答南将军吧。南将军的某次询问之后士兵i可能又杀敌q人，之后南将军再询问的时候，需要考虑到新增的杀敌数。输入 
只有一组测试数据 
第一行是]]></description><category></category></item></channel></rss>