<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[cccrown的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/cccrown</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; cccrown]]></copyright><item><title><![CDATA[重新学习JAVA]]></title><link>https://blog.youkuaiyun.com/cccrown/article/details/48241163</link><guid>https://blog.youkuaiyun.com/cccrown/article/details/48241163</guid><author>cccrown</author><pubDate>Sun, 06 Sep 2015 10:45:26 +0800</pubDate><description><![CDATA[11111]]></description><category></category></item><item><title><![CDATA[干]]></title><link>https://blog.youkuaiyun.com/cccrown/article/details/38305307</link><guid>https://blog.youkuaiyun.com/cccrown/article/details/38305307</guid><author>cccrown</author><pubDate>Wed, 30 Jul 2014 19:35:31 +0800</pubDate><description><![CDATA[POJ3046 题意:多重集组合问题 dp[i][j]=dp[i][j-1]+dp[i][j-i]]]></description><category></category></item><item><title><![CDATA[做做2 贪心]]></title><link>https://blog.youkuaiyun.com/cccrown/article/details/24708371</link><guid>https://blog.youkuaiyun.com/cccrown/article/details/24708371</guid><author>cccrown</author><pubDate>Tue, 29 Apr 2014 13:39:54 +0800</pubDate><description><![CDATA[1 / 6
Problem G
POJ 2376
Cleaning Shifts



1 / 2
Problem H
POJ 1328
Radar Installation



1 / 2
Problem I
POJ 3190
Stall Reservations



1 / 3
Problem J
POJ 2393
Yogurt factor]]></description><category></category></item><item><title><![CDATA[荷兰国旗问题]]></title><link>https://blog.youkuaiyun.com/cccrown/article/details/24663321</link><guid>https://blog.youkuaiyun.com/cccrown/article/details/24663321</guid><author>cccrown</author><pubDate>Mon, 28 Apr 2014 19:14:13 +0800</pubDate><description><![CDATA[荷兰国旗有三横条块构成，自上到下的三条块颜色依次为红、白、蓝。现有若干由红、白、蓝三种颜色的条块序列，要将它们重新排列使所有相同颜色的条块在一起。本问题要求将所有红色的条块放最左边、所有白色的条块放中间、所有蓝色的条块放最右边。


采用类似快排的分治思想]]></description><category></category></item><item><title><![CDATA[做做]]></title><link>https://blog.youkuaiyun.com/cccrown/article/details/24272035</link><guid>https://blog.youkuaiyun.com/cccrown/article/details/24272035</guid><author>cccrown</author><pubDate>Mon, 21 Apr 2014 21:30:25 +0800</pubDate><description><![CDATA[Aizu
 0558
POJ 3669

Aizu
 0121

POJ 2718]]></description><category></category></item><item><title><![CDATA[bitset]]></title><link>https://blog.youkuaiyun.com/cccrown/article/details/24268891</link><guid>https://blog.youkuaiyun.com/cccrown/article/details/24268891</guid><author>cccrown</author><pubDate>Mon, 21 Apr 2014 19:31:28 +0800</pubDate><description><![CDATA[有些程序要处理二进制位的有序集，每个位可能包含的是0（关）或1（开）的值。位是用来保存一组项或条件的yes/no信息（有时也称标志）的简洁方法。标准库提供了bitset类使得处理位集合更容易一些。要使用bitset类就必须要包含相关的头文件。在本书提供的例子中，假设都使用了std::bitset的using声明：

＃i nclude 

using std::bitset;

3.5]]></description><category></category></item><item><title><![CDATA[小鑫过河(优先队列+bfs)  字母重排   圆包含的方格个数  棋盘对角线穿越方格数]]></title><link>https://blog.youkuaiyun.com/cccrown/article/details/24242717</link><guid>https://blog.youkuaiyun.com/cccrown/article/details/24242717</guid><author>cccrown</author><pubDate>Mon, 21 Apr 2014 12:11:51 +0800</pubDate><description><![CDATA[#include
#include
#include

using namespace std;

struct Node{
  int x;
  int y;
  int t;
  Node(int xx=0, int yy=0, int tt=0):x(xx),y(yy),t(tt)
  {

  }
};

bool operator <(Node a, Node b)
{
    retu]]></description><category></category></item><item><title><![CDATA[priority_queue]]></title><link>https://blog.youkuaiyun.com/cccrown/article/details/24239187</link><guid>https://blog.youkuaiyun.com/cccrown/article/details/24239187</guid><author>cccrown</author><pubDate>Mon, 21 Apr 2014 11:18:19 +0800</pubDate><description><![CDATA[关于priority_queue
1,关于STL中的priority_queue:确定用top()查看顶部元素时,该元素是具有最高优先级的一个元素. 调用pop()删除之后,将促使下一个元素进入该位置. 
2,如同stack和queue,priority_queue是一个基于基本序列容器进行构建的适配器,默认的序列器是vector.
 

模板原型：

priority_queue]]></description><category></category></item><item><title><![CDATA[快速幂]]></title><link>https://blog.youkuaiyun.com/cccrown/article/details/24209465</link><guid>https://blog.youkuaiyun.com/cccrown/article/details/24209465</guid><author>cccrown</author><pubDate>Mon, 21 Apr 2014 00:43:55 +0800</pubDate><description><![CDATA[每次除2的快速幂超时了，]]></description><category></category></item><item><title><![CDATA[DFS poj3009]]></title><link>https://blog.youkuaiyun.com/cccrown/article/details/23262233</link><guid>https://blog.youkuaiyun.com/cccrown/article/details/23262233</guid><author>cccrown</author><pubDate>Wed, 09 Apr 2014 13:11:37 +0800</pubDate><description><![CDATA[#include

using namespace std;

int a[21][21];
int n, m;
int sx, sy, gx, gy;
int res;

void dfs(int k, int x, int y, int d)
{
    if(k>10) return;
    if(d==-1) a[x+1][y]=0;
    if(d==-2) a[x-1][y]=0;]]></description><category></category></item><item><title><![CDATA[POJ3233Matrix Power Series  矩阵快速幂(分块矩阵构造)]]></title><link>https://blog.youkuaiyun.com/cccrown/article/details/20849013</link><guid>https://blog.youkuaiyun.com/cccrown/article/details/20849013</guid><author>cccrown</author><pubDate>Sun, 09 Mar 2014 16:27:35 +0800</pubDate><description><![CDATA[# include
# include
# include
using namespace std;

int mod;

class Matrix{
public:
      int row;
      int col;
      int ** element;
      Matrix();
      ~Matrix();
      Matrix(const int , const]]></description><category></category></item><item><title><![CDATA[HDU3306 矩阵快速幂]]></title><link>https://blog.youkuaiyun.com/cccrown/article/details/20846085</link><guid>https://blog.youkuaiyun.com/cccrown/article/details/20846085</guid><author>cccrown</author><pubDate>Sun, 09 Mar 2014 15:19:15 +0800</pubDate><description><![CDATA[/*****************
Sn-1                         1   X^2  Y^2  2XY             Sn
An-1^2              *       0   X^2  Y^2  2XY    =       An^2
An-2^2                      0    1     0      0       ]]></description><category></category></item><item><title><![CDATA[HDU1568 求Fibonacci前几位  取对数]]></title><link>https://blog.youkuaiyun.com/cccrown/article/details/20836041</link><guid>https://blog.youkuaiyun.com/cccrown/article/details/20836041</guid><author>cccrown</author><pubDate>Sun, 09 Mar 2014 11:16:41 +0800</pubDate><description><![CDATA[Fibonacci
Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3100    Accepted Submission(s): 1435



Problem Description

2007年到来了。经过2006年]]></description><category></category></item><item><title><![CDATA[HDU1757 矩阵快速幂]]></title><link>https://blog.youkuaiyun.com/cccrown/article/details/20802545</link><guid>https://blog.youkuaiyun.com/cccrown/article/details/20802545</guid><author>cccrown</author><pubDate>Sat, 08 Mar 2014 22:39:25 +0800</pubDate><description><![CDATA[/***************************8
构造矩阵[a0 a1 a2 a3 a4 ... a9]         [ f(x-1) ]            [f(x)]
               1  0  ..                0
               0  1                            *        .]]></description><category></category></item><item><title><![CDATA[矩阵模板(尚未完善)]]></title><link>https://blog.youkuaiyun.com/cccrown/article/details/20798929</link><guid>https://blog.youkuaiyun.com/cccrown/article/details/20798929</guid><author>cccrown</author><pubDate>Sat, 08 Mar 2014 21:14:15 +0800</pubDate><description><![CDATA[参考别人的写的矩阵的模板
目前暂时只实现赋值，加，减， 乘， 转置;]]></description><category></category></item><item><title><![CDATA[【线段树】单点更新5]]></title><link>https://blog.youkuaiyun.com/cccrown/article/details/17365429</link><guid>https://blog.youkuaiyun.com/cccrown/article/details/17365429</guid><author>cccrown</author><pubDate>Tue, 17 Dec 2013 00:34:28 +0800</pubDate><description><![CDATA[/*****************************************
简单的单点更新，用一个c数组标记PushUp是应该OR还是XOR


****************************************/



Description

Xenia the beginner programmer has a sequence a, consis]]></description><category></category></item><item><title><![CDATA[【线段树】单点更新4]]></title><link>https://blog.youkuaiyun.com/cccrown/article/details/17364311</link><guid>https://blog.youkuaiyun.com/cccrown/article/details/17364311</guid><author>cccrown</author><pubDate>Mon, 16 Dec 2013 23:45:24 +0800</pubDate><description><![CDATA[/&&&&&&&&&&%$*%^&^#%@$$%^

抽象思维能力很重要！我只能满满积累了。起初没看懂题目怎么用线段树解

多亏了喵呜的指点！敲好了一次就过了

!@#$^%&*^(&(&^%&&$^%^&%^&((?/

Description

At the entrance to the university, there is a huge rectangular bi]]></description><category></category></item><item><title><![CDATA[uva127 "Accordian" Patience    poj1214  模拟]]></title><link>https://blog.youkuaiyun.com/cccrown/article/details/17297725</link><guid>https://blog.youkuaiyun.com/cccrown/article/details/17297725</guid><author>cccrown</author><pubDate>Fri, 13 Dec 2013 09:46:53 +0800</pubDate><description><![CDATA[/***********************************************
这个题目是我感触特别深的了， 第一次刷uva的题。题目不难，但印象颇深。
不得不说，runtime error 这个问题经常会困扰我， 曾经大多数时候是束手无策，只能改代码试试
这次我尝试生成一定数量的随机数据了， 每次输出这组数据，于是终于找到RE数据。
过程是痛苦的， 收获是丰富的， 虽然]]></description><category></category></item><item><title><![CDATA[get新技能！查找runtime error 数据]]></title><link>https://blog.youkuaiyun.com/cccrown/article/details/17297481</link><guid>https://blog.youkuaiyun.com/cccrown/article/details/17297481</guid><author>cccrown</author><pubDate>Fri, 13 Dec 2013 09:19:37 +0800</pubDate><description><![CDATA[大致思想是随机生成一定数量的符合题目要求的数据，然后读这些数据的时候加一行输出，就大概能找到runtime error的数据了]]></description><category></category></item><item><title><![CDATA[runtime error快饶了我吧]]></title><link>https://blog.youkuaiyun.com/cccrown/article/details/17297001</link><guid>https://blog.youkuaiyun.com/cccrown/article/details/17297001</guid><author>cccrown</author><pubDate>Fri, 13 Dec 2013 08:39:39 +0800</pubDate><description><![CDATA[不得不说，被runtime error搞残了。
少用指针，那有什么替代品？


ACCESS_VIOLATION 您的程序想从一些非法的地址空间读取或向其中写入内容。一般例如指针、数组下标越界都会造成这个错误的。
ARRAY_BOUNDS_EXCEEDED 您的程序试图访问一个超出硬件支持范围的数组单元。
FLOAT_DENORMAL_OPERAND 进行了一个非正常的浮点操作。一般是]]></description><category></category></item></channel></rss>