<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Darley_LL的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Darley_LL</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Darley_LL]]></copyright><item><title><![CDATA[产生数（弗洛伊德算法）]]></title><link>https://blog.youkuaiyun.com/Darley_LL/article/details/97814456</link><guid>https://blog.youkuaiyun.com/Darley_LL/article/details/97814456</guid><author>Darley_LL</author><pubDate>Tue, 30 Jul 2019 20:21:24 +0800</pubDate><description><![CDATA[产生数
参考代码:（弗洛伊德算法）
Tips:	Search the question yourself.
#include&lt;bits/stdc++.h&gt;
using namespace std;
int a[32],s[1000],f[11],l1,l2,len,p,k;
bool g[11][11];
char x;
void gjc(int x)
{
	for(int i=1;i...]]></description><category></category></item><item><title><![CDATA[间谍网络]]></title><link>https://blog.youkuaiyun.com/Darley_LL/article/details/97804579</link><guid>https://blog.youkuaiyun.com/Darley_LL/article/details/97804579</guid><author>Darley_LL</author><pubDate>Tue, 30 Jul 2019 17:57:17 +0800</pubDate><description><![CDATA[间谍网络（net.cpp）
Tips：适合初学者。
题目不再赘述。
Advantages:关于有间谍无法被控制的情况做了优化，降低了此种情况下时间复杂度。
#include&lt;bits/stdc++.h&gt;
using namespace std;
const int N=1e4+1;
int first[N],next[N],to[N],id[N],dfn[N],sta[N],low[N...]]></description><category></category></item></channel></rss>