<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[c0de4fun的完美算(nei)法(he)教室-我们仍不知道，那天调用的驱动的名字。]]></title><description><![CDATA[c0de4fun的自留地，数学白痴拒绝算法。【我就是活在底层的夜行百鬼，驱动幽灵】]]></description><link>https://blog.youkuaiyun.com/c0de4fun</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; c0de4fun]]></copyright><item><title><![CDATA[【MFC Windows程序设计（第二版）】第一章代码注释。]]></title><link>https://blog.youkuaiyun.com/c0de4fun/article/details/8703749</link><guid>https://blog.youkuaiyun.com/c0de4fun/article/details/8703749</guid><author>c0de4fun</author><pubDate>Thu, 21 Mar 2013 22:41:37 +0800</pubDate><description><![CDATA[/*CMyApp继承了CWinApp类，因此它就是应用程序对象。
	CWinApp类提供消息循环和调度。一个MFC应用程序可以有且仅有一个应用程序对象。此对象必须在全局声明内有效。
*/
class CMyApp:public CWinApp
{
public:
	virtual BOOL InitInstance();
	/* 上面这个函数是从CWinApp覆盖的，CWinApp本身具有这个函数]]></description><category></category></item><item><title><![CDATA[开坑预告，2013年新番来袭。]]></title><link>https://blog.youkuaiyun.com/c0de4fun/article/details/8697895</link><guid>https://blog.youkuaiyun.com/c0de4fun/article/details/8697895</guid><author>c0de4fun</author><pubDate>Wed, 20 Mar 2013 19:02:46 +0800</pubDate><description><![CDATA[算法白痴，也就是我，发现这里荒废好久了。
作为数学白痴，珍爱生命远离算法吧我还是。
从今天开始，不定期更新以下三本书读书笔记：
1.《MFC Windows程序设计》
2.《Rootkit，Windows内核的安全与防护》
3.《Windows内核情景再现》


以上。]]></description><category></category></item><item><title><![CDATA[【LaTeX】CTeX数据结构模板]]></title><link>https://blog.youkuaiyun.com/c0de4fun/article/details/8023006</link><guid>https://blog.youkuaiyun.com/c0de4fun/article/details/8023006</guid><author>c0de4fun</author><pubDate>Thu, 27 Sep 2012 00:28:08 +0800</pubDate><description><![CDATA[\documentclass[a4paper,11pt,oneside,openany]{article}
\usepackage{CJK}
\usepackage{times}
\usepackage{listings}
\usepackage{xcolor}
\usepackage{color}
\usepackage[top=1in, bottom=1in, left=0.75in, rig]]></description><category></category></item><item><title><![CDATA[【ZOJ3228】白濑肆の完美算法教室补番作，0.7%达成 白濑肆×AC自动机]]></title><link>https://blog.youkuaiyun.com/c0de4fun/article/details/7884691</link><guid>https://blog.youkuaiyun.com/c0de4fun/article/details/7884691</guid><author>c0de4fun</author><pubDate>Mon, 20 Aug 2012 01:51:56 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 

using namespace std;

/**
    就是一个AC自动机
    但是每个单词有两个状态，[0]是可以overlap，[1]是不能overlap时候的次数
    我们用last数组记录下每个不能overlap的单词出现的位置，如果
    当前位置 - last[word]]]></description><category></category></item><item><title><![CDATA[【CodeForces 155C Hometask】白濑肆×字符串+DP——果然是字符串处理什么的好讨厌啊尤其是换行符的处理看来不用CIN不行了呢DP的转移真心不会啊水到家了怎么办！【1.1%达成】]]></title><link>https://blog.youkuaiyun.com/c0de4fun/article/details/7884685</link><guid>https://blog.youkuaiyun.com/c0de4fun/article/details/7884685</guid><author>c0de4fun</author><pubDate>Mon, 20 Aug 2012 01:44:19 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
using namespace std;
const int MAX_SIZE = 1e5+10;
char text[MAX_SIZE];
/**
    Title: 白濑肆×字符串+DP——果然是字符串处理什么的好讨厌啊尤其是换行符的处理看来不用CIN不行了呢虽然效率低人家好伤心的还有就是DP的转移真心不会啊水到]]></description><category></category></item><item><title><![CDATA[【ZOJ3587】Marlon's String——白四爷×KMP 白濑肆の算法完全解读KMP篇 KMP来袭第二弹前缀什么的果然最讨厌了！【1.0%达成！】]]></title><link>https://blog.youkuaiyun.com/c0de4fun/article/details/7883301</link><guid>https://blog.youkuaiyun.com/c0de4fun/article/details/7883301</guid><author>c0de4fun</author><pubDate>Sun, 19 Aug 2012 15:19:17 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
/**
    Title: 【ZOJ3587】Marlon's String——白四爷×KMP 白濑肆の算法完全解读KMP篇 KMP来袭第二弹前缀什么的果然最讨厌了！【1.0%达成！】
    Problem: ZOJ3587 Marlon's String
    Knowledge Point : KMP算法の深]]></description><category></category></item><item><title><![CDATA[【HDU2222】  0.6%达成 模板题 果然无聊的时候A题才是最正确的选择啊因为你就会更加无聊]]></title><link>https://blog.youkuaiyun.com/c0de4fun/article/details/7879696</link><guid>https://blog.youkuaiyun.com/c0de4fun/article/details/7879696</guid><author>c0de4fun</author><pubDate>Sat, 18 Aug 2012 01:35:46 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
using namespace std;
/**
    Reference:http://www.cnblogs.com/procedure2012/archive/2012/01/29/2331460.html
    Thanks to: lpp学长给的模板和讲义
    Pre-Knowle]]></description><category></category></item><item><title><![CDATA[【0.9%】SPOJ7758 Grwoing Strings 解题报告 + AC代码 + 思路 + AC自动机简短总结]]></title><link>https://blog.youkuaiyun.com/c0de4fun/article/details/7879597</link><guid>https://blog.youkuaiyun.com/c0de4fun/article/details/7879597</guid><author>c0de4fun</author><pubDate>Sat, 18 Aug 2012 00:05:19 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
using namespace std;
const int MAX_SIZE = 1000100;
/**
    【0.9%】SPOJ7758 Grwoing Strings 解题报告 + AC代码 + 思路 + AC自动机简短总结
    ——果然智商捉急的话就要WA到死才能AC啊人生来不是给]]></description><category></category></item><item><title><![CDATA[【HDU1686】Oulipo 思路+解题报告+代码+KMP算法个人理解 【0.5%达成】]]></title><link>https://blog.youkuaiyun.com/c0de4fun/article/details/7845625</link><guid>https://blog.youkuaiyun.com/c0de4fun/article/details/7845625</guid><author>c0de4fun</author><pubDate>Thu, 09 Aug 2012 01:54:53 +0800</pubDate><description><![CDATA[HDU的题意就是，给你一个字符串A，一个字符串B，求A在B中总共出现了几次，注意，重复的也算。
比如说
str1 = "ABA"
str2 = "ABABABA"
这样的话，那么str1就在str2中出现了三次。
当然，按照HDU一贯淫荡的套路，朴素算法肯定会超时。
Thanks to lpp学长那个秒杀级的样例。。。
——————————注意以下内容纯属个人理解如果有误【十分欢迎，]]></description><category></category></item><item><title><![CDATA[【HDU4313】 - Matrix - 树状DP Version 思路+解题报告+AC代码【0.4%达成】]]></title><link>https://blog.youkuaiyun.com/c0de4fun/article/details/7833635</link><guid>https://blog.youkuaiyun.com/c0de4fun/article/details/7833635</guid><author>c0de4fun</author><pubDate>Mon, 06 Aug 2012 02:29:22 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
using namespace std;
/**

    Problem: HDU4313 - Matrix - DP Version【0.4%达成】
    Copyright : 归我们学校集训队和本人所有，未经同意可以转载。
                【但是胆敢用于培训的话，贵学校服务]]></description><category></category></item><item><title><![CDATA[【HDU3415】Max Sum of Max-K-sub-sequence，思路+解题报告+AC代码+自虐般疯狂吐槽【0.3%达成！】]]></title><link>https://blog.youkuaiyun.com/c0de4fun/article/details/7825331</link><guid>https://blog.youkuaiyun.com/c0de4fun/article/details/7825331</guid><author>c0de4fun</author><pubDate>Fri, 03 Aug 2012 02:56:37 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
using namespace std;
const int MAX_SIZE = 100010 * 2;
const int INFINITE = 99999999;
int num[MAX_SIZE];
int sum[MAX_SIZE];
int q[MAX_SIZE];
int ind[MAX_SIZE];
i]]></description><category></category></item><item><title><![CDATA[【HDU4313】Matrix 多校 解题报告+AC代码+思路+算法正确性证明，此为Kruskal贪心恶心版本，非自虐倾向慎入！建议想找解题报告的童鞋看简单版本的，这个我写给自己【目标达成 0.2%】]]></title><link>https://blog.youkuaiyun.com/c0de4fun/article/details/7820905</link><guid>https://blog.youkuaiyun.com/c0de4fun/article/details/7820905</guid><author>c0de4fun</author><pubDate>Thu, 02 Aug 2012 03:40:30 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 

using namespace std;
/**
    【警告】这个恶心版本是我写给自己看的，关于解题报告，还是请移步简单版本吧，就在这篇文章的前一篇。



    c0de4fun声明：本人未给出测试数据、未声明一次AC的题均为参考解题报告自己写的。
                  对那些无私贡献的大神真诚]]></description><category></category></item><item><title><![CDATA[【HDU4313】Matrix 多校  解题报告+AC代码+思路+算法正确性证明，此为Kruskal贪心简单版本，恶心版本稍后放出【目标达成 0.2%】]]></title><link>https://blog.youkuaiyun.com/c0de4fun/article/details/7820894</link><guid>https://blog.youkuaiyun.com/c0de4fun/article/details/7820894</guid><author>c0de4fun</author><pubDate>Thu, 02 Aug 2012 03:26:47 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 

using namespace std;
/**
    c0de4fun声明：本人未给出测试数据、未声明一次AC的题均为参考解题报告自己写的。
                  对那些无私贡献的大神真诚的致敬！本题的测试数据可以看最后面
    Problem: HDU4313 - Matrix
    Refe]]></description><category></category></item><item><title><![CDATA[【ZOJ3471】Most Powerful， 思路+源代码+解题报告（好久没写解题报告了……）【目标达成:0.1%】]]></title><link>https://blog.youkuaiyun.com/c0de4fun/article/details/7820613</link><guid>https://blog.youkuaiyun.com/c0de4fun/article/details/7820613</guid><author>c0de4fun</author><pubDate>Wed, 01 Aug 2012 23:46:47 +0800</pubDate><description><![CDATA[/**


    Problem:ZOJ3471-Most Powerful.
    Reference:http://blog.youkuaiyun.com/magicnumber/article/details/6182891
    Knowledge point:状态压缩DP
    Thought:
    根据炮兵阵地（那是别的题）和这道题，还有一次多校的经验（就是那个类似拼图的那个题，给你]]></description><category></category></item><item><title><![CDATA[【HDU2571】命运]]></title><link>https://blog.youkuaiyun.com/c0de4fun/article/details/7521739</link><guid>https://blog.youkuaiyun.com/c0de4fun/article/details/7521739</guid><author>c0de4fun</author><pubDate>Sun, 29 Apr 2012 01:19:38 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 

using namespace std;
const int MAXN = 100;
const int MAXM = 1100;
int maze[MAXN][MAXM];
int dp[MAXN][MAXM];
int solve(int n,int m,int N,int M)
{
//向下一次只能走一格。但是]]></description><category></category></item><item><title><![CDATA[【UVA11205】The broken pedometer，思路+代码，可能是最不装逼最朴素最易懂效率也最差的代码。]]></title><link>https://blog.youkuaiyun.com/c0de4fun/article/details/7405471</link><guid>https://blog.youkuaiyun.com/c0de4fun/article/details/7405471</guid><author>c0de4fun</author><pubDate>Thu, 29 Mar 2012 02:17:52 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
using namespace std;
/**
    Problem : UVA11205 - The broken pedometer
    Begin Time: 28th/Mar/2012 11:30 a.m.
    Finish Time: 29th/Mar/2012 2:14 a.]]></description><category></category></item><item><title><![CDATA[【POJ1077】Eight 八数码问题，解题报告+思路+代码]]></title><link>https://blog.youkuaiyun.com/c0de4fun/article/details/7389888</link><guid>https://blog.youkuaiyun.com/c0de4fun/article/details/7389888</guid><author>c0de4fun</author><pubDate>Sat, 24 Mar 2012 12:48:48 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
  #define INPUT
using namespace std;
/**
    Problem : poj1077,hdu1043，经典的八数码问题。
    知识点： BFS + HASH + 打表 + 父亲节点记录
    境界：3 - BFS+HASH+打表

    A了两天！！！
    记得拿启发式，双向BFS重新写]]></description><category></category></item><item><title><![CDATA[【UVa10167】  Birthday Cake，思路+代码+解题报告]]></title><link>https://blog.youkuaiyun.com/c0de4fun/article/details/7384536</link><guid>https://blog.youkuaiyun.com/c0de4fun/article/details/7384536</guid><author>c0de4fun</author><pubDate>Thu, 22 Mar 2012 19:35:11 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
// #define INPUT
/**
    Problem: UVA10167 - Birthday Cake
    Begin Time:22nd/Mar/2012 5:00 p.m.
    End Time: 22nd/Mar/2012 7:35 p.m.
    Last Time: 2H 35M]]></description><category></category></item><item><title><![CDATA[【ACM模板】HASH表（无删除功能，添查）]]></title><link>https://blog.youkuaiyun.com/c0de4fun/article/details/7381475</link><guid>https://blog.youkuaiyun.com/c0de4fun/article/details/7381475</guid><author>c0de4fun</author><pubDate>Thu, 22 Mar 2012 00:07:04 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;
const int HASH_SIZE = 1000000;
const int HASH_KEY = 17;
int next[HASH_KEY][HASH_SIZE];
int hash[HASH_SIZE];
int origin_]]></description><category></category></item><item><title><![CDATA[【POJ3740】Easy Finding，解题报告+思路+代码]]></title><link>https://blog.youkuaiyun.com/c0de4fun/article/details/7380986</link><guid>https://blog.youkuaiyun.com/c0de4fun/article/details/7380986</guid><author>c0de4fun</author><pubDate>Wed, 21 Mar 2012 21:25:00 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
//#define INPUT
/**
    Problem: poj3740 - Easy Finding
    Begin Time:8:30 p.m. 20th/Mar/2012
    End Time: 8:42 p.m. 21st/Mar/2012
    Last Time: Maybe 4hours]]></description><category></category></item></channel></rss>