<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[dark_master的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/dark_master</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; dark_master]]></copyright><item><title><![CDATA[强连通图和双连通图]]></title><link>https://blog.youkuaiyun.com/dark_master/article/details/77995175</link><guid>https://blog.youkuaiyun.com/dark_master/article/details/77995175</guid><author>dark_master</author><pubDate>Fri, 15 Sep 2017 19:59:10 +0800</pubDate><description><![CDATA[刚刚弄明白了强连通和双连通，我好菜啊。。TUT
两道差不多的题目，POJ - 3177 
和计蒜客的Islands
poj-3177 给出很多边，问添加最少多少条边成为一个双连通
Islands 变成强连通
强连通：图中任意两个节点可以相互通达
双连通：图中任意两个节点之间都有两条路
POJ-3177 跑一遍Tarjan 所有的双连通块看做一个点，将整个图看做一棵树，把整棵树的叶子节]]></description><category></category></item><item><title><![CDATA[HDU - 1024  Max Sum Plus Plus]]></title><link>https://blog.youkuaiyun.com/dark_master/article/details/73743683</link><guid>https://blog.youkuaiyun.com/dark_master/article/details/73743683</guid><author>dark_master</author><pubDate>Mon, 26 Jun 2017 20:22:28 +0800</pubDate><description><![CDATA[本题是连续最大子序列和的加强版。
题目大意为 从一序列中取出若干段,使得这几段的和最大.

不得不说。。DP真的好难啊→ →

基本的连续最大子序列和代码为
#include
#include
#include
using namespace std;
int a[1234];
int main()
{
    int n;
    while(~scanf("%d",&n))
   ]]></description><category></category></item><item><title><![CDATA[基础DP学习之【货币问题】]]></title><link>https://blog.youkuaiyun.com/dark_master/article/details/73729273</link><guid>https://blog.youkuaiyun.com/dark_master/article/details/73729273</guid><author>dark_master</author><pubDate>Sun, 25 Jun 2017 20:42:51 +0800</pubDate><description><![CDATA[问题 D: 【动态规划】货币面值
时间限制: 1 Sec  内存限制: 64 MB
提交: 16  解决: 14
[提交][状态][讨论版]
题目描述
魔法世界发行了很多不同面值的纸币，试求出用这些纸币进行任意的组合不能表示的最小面值是多少。
输入
输入包含多个测试用例，每组测试用例的第一行输入一个整数N（N≤100）表示流通的纸币面额数量，第二行是N个纸币的具体表示面额，取值范围为]]></description><category></category></item><item><title><![CDATA[基础DP学习之【数的划分】]]></title><link>https://blog.youkuaiyun.com/dark_master/article/details/73724715</link><guid>https://blog.youkuaiyun.com/dark_master/article/details/73724715</guid><author>dark_master</author><pubDate>Sun, 25 Jun 2017 19:12:39 +0800</pubDate><description><![CDATA[题目描述 Description

将整数n分成k份，且每份不能为空，任意两种划分方案不能相同(不考虑顺序)。
例如：n=7，k=3，下面三种划分方案被认为是相同的。
1 1 5
1 5 1
5 1 1
问有多少种不同的分法。




输入描述 Input Description

输入：n，k (6




输出描述 Output Description]]></description><category></category></item><item><title><![CDATA[Max Sum Plus Plus HDU - 1024]]></title><link>https://blog.youkuaiyun.com/dark_master/article/details/73175902</link><guid>https://blog.youkuaiyun.com/dark_master/article/details/73175902</guid><author>dark_master</author><pubDate>Tue, 13 Jun 2017 13:34:48 +0800</pubDate><description><![CDATA[Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now you are faced with a more difficult problem. 

Gi]]></description><category></category></item><item><title><![CDATA[POJ-3159 Candies]]></title><link>https://blog.youkuaiyun.com/dark_master/article/details/73130027</link><guid>https://blog.youkuaiyun.com/dark_master/article/details/73130027</guid><author>dark_master</author><pubDate>Mon, 12 Jun 2017 17:49:29 +0800</pubDate><description><![CDATA[During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class a large bag of candies and had flymouse distribute them. All the]]></description><category></category></item><item><title><![CDATA[POJ-1511 Invitation Cards]]></title><link>https://blog.youkuaiyun.com/dark_master/article/details/73129273</link><guid>https://blog.youkuaiyun.com/dark_master/article/details/73129273</guid><author>dark_master</author><pubDate>Mon, 12 Jun 2017 17:29:17 +0800</pubDate><description><![CDATA[In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique Comedies. They ]]></description><category></category></item><item><title><![CDATA[poj2240 - Arbitrage]]></title><link>https://blog.youkuaiyun.com/dark_master/article/details/73127623</link><guid>https://blog.youkuaiyun.com/dark_master/article/details/73127623</guid><author>dark_master</author><pubDate>Mon, 12 Jun 2017 17:16:42 +0800</pubDate><description><![CDATA[Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For example, suppose that 1 US Dollar buys 0.5 Britis]]></description><category></category></item><item><title><![CDATA[UVA 12506  Shortest Names]]></title><link>https://blog.youkuaiyun.com/dark_master/article/details/72943723</link><guid>https://blog.youkuaiyun.com/dark_master/article/details/72943723</guid><author>dark_master</author><pubDate>Thu, 08 Jun 2017 23:55:24 +0800</pubDate><description><![CDATA[In a strange village, people have very long names. For example: aaaaa, bbb and abababab. You see, it’s very inconvenient to call a person, so people invented a good way: just call a preﬁx of the names]]></description><category></category></item><item><title><![CDATA[UVA 10214 Trees in a Wood.]]></title><link>https://blog.youkuaiyun.com/dark_master/article/details/72861105</link><guid>https://blog.youkuaiyun.com/dark_master/article/details/72861105</guid><author>dark_master</author><pubDate>Sun, 04 Jun 2017 20:25:29 +0800</pubDate><description><![CDATA[复制、不下、来！！= =！
直接上代码好了、、
phi函数是用来计算小于且与n互质的数的个数的。
两个数互质，其GCD为1
先用欧拉函数求出个数，在把剩下的枚举一遍就OK
#include
#include
#include
using namespace std;
const int MAXN=2000;
int phi[MAXN];
int vis[MAXN];
void Init(]]></description><category></category></item><item><title><![CDATA[POJ 3259 Wormholes]]></title><link>https://blog.youkuaiyun.com/dark_master/article/details/72834692</link><guid>https://blog.youkuaiyun.com/dark_master/article/details/72834692</guid><author>dark_master</author><pubDate>Thu, 01 Jun 2017 20:02:34 +0800</pubDate><description><![CDATA[While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a time that i]]></description><category></category></item><item><title><![CDATA[UVA 12034 Race 动态规划+递推]]></title><link>https://blog.youkuaiyun.com/dark_master/article/details/72818930</link><guid>https://blog.youkuaiyun.com/dark_master/article/details/72818930</guid><author>dark_master</author><pubDate>Wed, 31 May 2017 11:33:45 +0800</pubDate><description><![CDATA[Disky and Sooma, two of the biggest mega minds of Bangladesh went to a far country. They ate, coded
and wandered around, even in their holidays. They passed several months in this way. But everything]]></description><category></category></item><item><title><![CDATA[UVA 1635 Irrelevant Elements 唯一分解定律]]></title><link>https://blog.youkuaiyun.com/dark_master/article/details/72794294</link><guid>https://blog.youkuaiyun.com/dark_master/article/details/72794294</guid><author>dark_master</author><pubDate>Sun, 28 May 2017 19:12:58 +0800</pubDate><description><![CDATA[Young cryptoanalyst Georgie is investigating diﬀerent schemes of generating random integer numbers ranging from 0 to m−1. He thinks that standard random number generators are not good enough, so he ha]]></description><category></category></item><item><title><![CDATA[UVA 10791 Minimum Sum LCM]]></title><link>https://blog.youkuaiyun.com/dark_master/article/details/72790294</link><guid>https://blog.youkuaiyun.com/dark_master/article/details/72790294</guid><author>dark_master</author><pubDate>Sun, 28 May 2017 10:10:43 +0800</pubDate><description><![CDATA[LCM (Least Common Multiple) of a set of integers is deﬁned as the minimum number, which is a multiple of all integers of that set. It is interesting to note that any positive integer can be expressed ]]></description><category></category></item><item><title><![CDATA[UVA 10375 Choose and divide]]></title><link>https://blog.youkuaiyun.com/dark_master/article/details/72784579</link><guid>https://blog.youkuaiyun.com/dark_master/article/details/72784579</guid><author>dark_master</author><pubDate>Sat, 27 May 2017 21:47:34 +0800</pubDate><description><![CDATA[The binomial coeﬃcient C(m,n) is deﬁned as
C(m,n) =
m! (m−n)! n! Given four natural numbers p, q, r, and s, compute the the result of dividing C(p,q) by C(r,s).
·Input
Input consists of a sequence]]></description><category></category></item><item><title><![CDATA[HDU 1043 Eight A*算法+康托展开]]></title><link>https://blog.youkuaiyun.com/dark_master/article/details/72782687</link><guid>https://blog.youkuaiyun.com/dark_master/article/details/72782687</guid><author>dark_master</author><pubDate>Sat, 27 May 2017 16:37:41 +0800</pubDate><description><![CDATA[The 15-puzzle has been around for over 100 years; even if you don't know it by that name, you've seen it. It is constructed with 15 sliding tiles, each with a number from 1 to 15 on it, and all packed]]></description><category></category></item><item><title><![CDATA[UVA 11528 Colossal Fibonacci Numbers! 数学，幂取模，循环节，]]></title><link>https://blog.youkuaiyun.com/dark_master/article/details/72773321</link><guid>https://blog.youkuaiyun.com/dark_master/article/details/72773321</guid><author>dark_master</author><pubDate>Fri, 26 May 2017 20:30:09 +0800</pubDate><description><![CDATA[题目实在是复制不过来了。。
2的64次方是unsigned long long 的最大值，输入输出用%llu，用%I64u不知道为什么会WA...TvT
通过对n=2，3，4……打表发现，每次都会有一个循环节出现，所以每次循环到0和1的时候即为一个新的循环节。
用vector动态数组存正好可以
AC代码：
#include
#include
#include
#include
using]]></description><category></category></item><item><title><![CDATA[HDU 1506 DNA sequence IDA*]]></title><link>https://blog.youkuaiyun.com/dark_master/article/details/72677744</link><guid>https://blog.youkuaiyun.com/dark_master/article/details/72677744</guid><author>dark_master</author><pubDate>Wed, 24 May 2017 16:37:44 +0800</pubDate><description><![CDATA[The twenty-first century is a biology-technology developing century. We know that a gene is made of DNA. The nucleotide bases from which DNA is built are A(adenine), C(cytosine), G(guanine), and T(thy]]></description><category></category></item><item><title><![CDATA[HDU 3533 Escape]]></title><link>https://blog.youkuaiyun.com/dark_master/article/details/72676897</link><guid>https://blog.youkuaiyun.com/dark_master/article/details/72676897</guid><author>dark_master</author><pubDate>Wed, 24 May 2017 15:36:38 +0800</pubDate><description><![CDATA[The students of the HEU are maneuvering for their military training. 
The red army and the blue army are at war today. The blue army finds that Little A is the spy of the red army, so Little A has to]]></description><category></category></item><item><title><![CDATA[HDU 3001 Travelling]]></title><link>https://blog.youkuaiyun.com/dark_master/article/details/72666904</link><guid>https://blog.youkuaiyun.com/dark_master/article/details/72666904</guid><author>dark_master</author><pubDate>Tue, 23 May 2017 20:57:37 +0800</pubDate><description><![CDATA[After coding so many days,Mr Acmer wants to have a good rest.So travelling is the best choice!He has decided to visit n cities(he insists on seeing all the cities!And he does not mind which city being]]></description><category></category></item></channel></rss>