<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Magic__]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/Magic____</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; Magic____]]></copyright><item><title><![CDATA[POJ 3254 Corn Fields]]></title><link>https://blog.csdn.net/Magic____/article/details/15542833</link><guid>https://blog.csdn.net/Magic____/article/details/15542833</guid><author>Magic____</author><pubDate>Tue, 12 Nov 2013 19:36:20 +0800</pubDate><description><![CDATA[Corn Fields




Time Limit: 2000MS
 
Memory Limit: 65536K


Total Submissions: 5764
 
Accepted: 3053




Description

Farmer John has purchased a lush new rectangular pasture compos]]></description><category></category></item><item><title><![CDATA[INT 21H 指令说明及使用方法]]></title><link>https://blog.csdn.net/Magic____/article/details/13277333</link><guid>https://blog.csdn.net/Magic____/article/details/13277333</guid><author>Magic____</author><pubDate>Sun, 27 Oct 2013 22:23:08 +0800</pubDate><description><![CDATA[转自：INT 21H 指令说明及使用方法
很多初学汇编语言的同学可能会对INT 21H这条指令感到困惑，不知道是什么意思，下面就以一段简单的程序为大家讲解：
例如：需要键盘输入，并且回显。
AH的值需要查表取得，表在下面
指令：MOV AH,01
     INT 21H
通过这样两条指令，输入的字符就会被存储在AL中。
 
表：DOS系统功能调INT 21H




A]]></description><category></category></item><item><title><![CDATA[POJ 2096 Collecting Bugs]]></title><link>https://blog.csdn.net/Magic____/article/details/12404667</link><guid>https://blog.csdn.net/Magic____/article/details/12404667</guid><author>Magic____</author><pubDate>Mon, 07 Oct 2013 21:46:58 +0800</pubDate><description><![CDATA[Collecting Bugs




Time Limit: 10000MS
 
Memory Limit: 64000K


Total Submissions: 1794
 
Accepted: 834


Case Time Limit: 2000MS
 
Special Judge




Description
Ivan is fond o]]></description><category></category></item><item><title><![CDATA[POJ 3744 Scout YYF I]]></title><link>https://blog.csdn.net/Magic____/article/details/12315191</link><guid>https://blog.csdn.net/Magic____/article/details/12315191</guid><author>Magic____</author><pubDate>Sat, 05 Oct 2013 17:11:47 +0800</pubDate><description><![CDATA[Scout YYF I




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 4090
 
Accepted: 1050




Description

YYF is a couragous scout. Now he is on a dangerous mission whic]]></description><category></category></item><item><title><![CDATA[POJ 1753 Flip Game]]></title><link>https://blog.csdn.net/Magic____/article/details/12281653</link><guid>https://blog.csdn.net/Magic____/article/details/12281653</guid><author>Magic____</author><pubDate>Fri, 04 Oct 2013 15:51:04 +0800</pubDate><description><![CDATA[Flip Game




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 26252
 
Accepted: 11333




Description

Flip game is played on a rectangular 4x4 field with two-sided p]]></description><category></category></item><item><title><![CDATA[POJ 2411 Mondriaan's Dream]]></title><link>https://blog.csdn.net/Magic____/article/details/12273609</link><guid>https://blog.csdn.net/Magic____/article/details/12273609</guid><author>Magic____</author><pubDate>Fri, 04 Oct 2013 10:25:11 +0800</pubDate><description><![CDATA[Mondriaan's Dream




Time Limit: 3000MS
 
Memory Limit: 65536K


Total Submissions: 9975
 
Accepted: 5772




Description

Squares and rectangles fascinated the famous Dutch painte]]></description><category></category></item><item><title><![CDATA[POJ 1185 炮兵阵地]]></title><link>https://blog.csdn.net/Magic____/article/details/12241181</link><guid>https://blog.csdn.net/Magic____/article/details/12241181</guid><author>Magic____</author><pubDate>Wed, 02 Oct 2013 21:28:42 +0800</pubDate><description><![CDATA[炮兵阵地




Time Limit: 2000MS
 
Memory Limit: 65536K


Total Submissions: 16310
 
Accepted: 6212




Description
司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成，地图的每一格可能是山地（用"H" 表示），也可能是平]]></description><category></category></item><item><title><![CDATA[CSU 1317 Find the max Link]]></title><link>https://blog.csdn.net/Magic____/article/details/10828367</link><guid>https://blog.csdn.net/Magic____/article/details/10828367</guid><author>Magic____</author><pubDate>Sun, 01 Sep 2013 16:04:08 +0800</pubDate><description><![CDATA[1317: Find the max Link
Time Limit: 1 Sec  Memory Limit: 
128 MB

[Submit][Status][Web
 Board]
Description

由N个点组成的无向图，每条边有对应的权值，保证每两点之间存在且仅存在一条路径，一条路径的权值为其所有边的权值之和，请找出一条路径，对于图中每个点至多经过一次,并且这条路]]></description><category></category></item><item><title><![CDATA[Hdu 4691 Front compression]]></title><link>https://blog.csdn.net/Magic____/article/details/10353399</link><guid>https://blog.csdn.net/Magic____/article/details/10353399</guid><author>Magic____</author><pubDate>Mon, 26 Aug 2013 17:06:00 +0800</pubDate><description><![CDATA[点击打开链接
后缀数组

错误的代码。。。。 未找到原因
#include
#include
#include


#define maxn 110000

using namespace std;

char s[maxn];
__int64 Star[maxn],End[maxn];
__int64 sa[maxn],t[maxn],t2[maxn],c[maxn],n;
__int6]]></description><category></category></item><item><title><![CDATA[LA 3523 - Knights of the Round Table]]></title><link>https://blog.csdn.net/Magic____/article/details/10081267</link><guid>https://blog.csdn.net/Magic____/article/details/10081267</guid><author>Magic____</author><pubDate>Mon, 19 Aug 2013 18:24:35 +0800</pubDate><description><![CDATA[题目链接：点击打开链接


训练指南P316


//割顶的bccno无意义

#include
#include
#include
#include

using namespace std;

#define maxn 1100

struct Edge{
	int u,v;
};

int pre[maxn],iscut[maxn],bccno[maxn],dfs_clock,b]]></description><category></category></item><item><title><![CDATA[计算点-双连通分量算法]]></title><link>https://blog.csdn.net/Magic____/article/details/10077837</link><guid>https://blog.csdn.net/Magic____/article/details/10077837</guid><author>Magic____</author><pubDate>Mon, 19 Aug 2013 16:59:48 +0800</pubDate><description><![CDATA[//割顶的bccno无意义

#include
#include
#include
#include

using namespace std;

#define maxn 1100

struct Edge{
	int u,v;
};

int pre[maxn],iscut[maxn],bccno[maxn],dfs_clock,bcc_cnt;

stack S;
vector G[maxn]]></description><category></category></item><item><title><![CDATA[HDU 4666 Hyperspace]]></title><link>https://blog.csdn.net/Magic____/article/details/9985913</link><guid>https://blog.csdn.net/Magic____/article/details/9985913</guid><author>Magic____</author><pubDate>Thu, 15 Aug 2013 16:35:58 +0800</pubDate><description><![CDATA[Hyperspace
Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)




Problem Description
The great Mr.Smith has invented a hyperspace particle generator. The dev]]></description><category></category></item><item><title><![CDATA[Hdu 1255 覆盖的面积]]></title><link>https://blog.csdn.net/Magic____/article/details/9978979</link><guid>https://blog.csdn.net/Magic____/article/details/9978979</guid><author>Magic____</author><pubDate>Thu, 15 Aug 2013 10:20:03 +0800</pubDate><description><![CDATA[覆盖的面积
Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)




Problem Description
给定平面上若干矩形,求出被这些矩形覆盖过至少两次的区域的面积.




 

Input
输入数据的第一行是一个正整数T(1

注意:本]]></description><category></category></item><item><title><![CDATA[Hdu 1542 Atlantis]]></title><link>https://blog.csdn.net/Magic____/article/details/9978869</link><guid>https://blog.csdn.net/Magic____/article/details/9978869</guid><author>Magic____</author><pubDate>Thu, 15 Aug 2013 10:16:50 +0800</pubDate><description><![CDATA[Atlantis
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)




Problem Description
There are several ancient Greek texts that contain descriptions of the fable]]></description><category></category></item><item><title><![CDATA[ACM算法训练]]></title><link>https://blog.csdn.net/Magic____/article/details/9942963</link><guid>https://blog.csdn.net/Magic____/article/details/9942963</guid><author>Magic____</author><pubDate>Tue, 13 Aug 2013 09:39:39 +0800</pubDate><description><![CDATA[转载的0.0


经典训练参照，不解释了，很好~
1.图论
2.数据结构
3.搜索
4.动态规划
5.模拟
6.数学
7.计算几何
8.博弈论
9.字符串
＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝
初期:
一.基本算法:
(1)枚举. (poj1753,poj2965)
(2)贪心(poj1328,poj2109,poj2]]></description><category></category></item><item><title><![CDATA[POJ 3667 Hotel]]></title><link>https://blog.csdn.net/Magic____/article/details/9942811</link><guid>https://blog.csdn.net/Magic____/article/details/9942811</guid><author>Magic____</author><pubDate>Tue, 13 Aug 2013 09:34:16 +0800</pubDate><description><![CDATA[Hotel




Time Limit: 3000MS
 
Memory Limit: 65536K


Total Submissions: 9597
 
Accepted: 4113




Description


The cows are journeying north to Thunder Bay in Canada to gain cult]]></description><category></category></item><item><title><![CDATA[后缀数组 （由倍增算法构造）]]></title><link>https://blog.csdn.net/Magic____/article/details/9703799</link><guid>https://blog.csdn.net/Magic____/article/details/9703799</guid><author>Magic____</author><pubDate>Thu, 01 Aug 2013 15:41:11 +0800</pubDate><description><![CDATA[//倍增算法构造后缀数组
//时间复杂度O(nlogn)			空间复杂度O(n)
#include
#include
#include

using namespace std;

#define MAXN 110000

int n;																//n为处理字符串s的长度
char s[MAXN],tmp[MAXN];														//s为输入的字符串
int ]]></description><category></category></item><item><title><![CDATA[Hdu 4628 Pieces]]></title><link>https://blog.csdn.net/Magic____/article/details/9667775</link><guid>https://blog.csdn.net/Magic____/article/details/9667775</guid><author>Magic____</author><pubDate>Wed, 31 Jul 2013 14:36:48 +0800</pubDate><description><![CDATA[Pieces
                   Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)



Problem Description
You heart broke into pieces.My string broke into pieces.But]]></description><category></category></item><item><title><![CDATA[POJ 2528 Mayor's posters]]></title><link>https://blog.csdn.net/Magic____/article/details/9618103</link><guid>https://blog.csdn.net/Magic____/article/details/9618103</guid><author>Magic____</author><pubDate>Mon, 29 Jul 2013 16:49:04 +0800</pubDate><description><![CDATA[Mayor's posters

Description
The citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all places at their whim]]></description><category></category></item><item><title><![CDATA[HDU 4619 Warm up 2]]></title><link>https://blog.csdn.net/Magic____/article/details/9500925</link><guid>https://blog.csdn.net/Magic____/article/details/9500925</guid><author>Magic____</author><pubDate>Fri, 26 Jul 2013 21:59:28 +0800</pubDate><description><![CDATA[Warm up 2
Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)



Problem Description
　　Some 1×2 dominoes are placed on a plane. Each dominoe is placed either hori]]></description><category></category></item></channel></rss>