<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[a6334167的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/a6334167</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; a6334167]]></copyright><item><title><![CDATA[对于大于等于3的整数n，在区间【n,3/2 * n】中一定存在一个素数]]></title><link>https://blog.youkuaiyun.com/a6334167/article/details/101834887</link><guid>https://blog.youkuaiyun.com/a6334167/article/details/101834887</guid><author>a6334167</author><pubDate>Mon, 30 Sep 2019 17:33:00 +0800</pubDate><description><![CDATA[对于大于3的整数n，在区间【n,3/2 * n】中一定存在一个素数

转载于:https://www.cnblogs.com/yuanweidao/p/11613629.html]]></description><category></category></item><item><title><![CDATA[Coloring Edges 【拓扑判环】]]></title><link>https://blog.youkuaiyun.com/a6334167/article/details/101834884</link><guid>https://blog.youkuaiyun.com/a6334167/article/details/101834884</guid><author>a6334167</author><pubDate>Mon, 30 Sep 2019 13:03:00 +0800</pubDate><description><![CDATA[题目链接：https://vjudge.net/contest/330119#problem/A
题目大意：
1.给出一张有向图，给该图涂色，要求同一个环里的边不可以全部都为同一种颜色。问最少需要多少颜色，并输出各边的涂色。
解题思路：
1.多画几张图就发现，颜色种类只会是1或者2。当不存在环的时候，全部涂1。当存在环的时候，环中可以分成两种边（小节点指向大节点涂1，大节点指向小...]]></description><category></category></item><item><title><![CDATA[1-2-K Game]]></title><link>https://blog.youkuaiyun.com/a6334167/article/details/101834885</link><guid>https://blog.youkuaiyun.com/a6334167/article/details/101834885</guid><author>a6334167</author><pubDate>Mon, 30 Sep 2019 11:26:00 +0800</pubDate><description><![CDATA[题目链接：https://vjudge.net/contest/330119#problem/E
题目大意可以理解为：
1.给出n个物品以及k，Alice与Bob轮流拿1个,或2个,或k个物品,Alice先手, 谁最后拿完所有的物品 谁就赢。
题解思路：https://www.cnblogs.com/think-twice/p/11190574.html

#include&l...]]></description><category></category></item><item><title><![CDATA[2019华东交通大学ACM基地简介]]></title><link>https://blog.youkuaiyun.com/a6334167/article/details/101834878</link><guid>https://blog.youkuaiyun.com/a6334167/article/details/101834878</guid><author>a6334167</author><pubDate>Sat, 28 Sep 2019 21:20:00 +0800</pubDate><description><![CDATA[一.基地成就简介：
ACM国际大学生程序设计竞赛（英文全称：ACM International Collegiate Programming Contest（简称ACM-ICPC或ICPC））是由国际计算机协会（ACM）主办的，一项旨在展示大学生创新能力、团队精神和在压力下编写程序、分析和解决问题能力的年度竞赛。经过40多年的发展，ACM国际大学生程序设计竞赛已经发展成为全球最具影响力...]]></description><category></category></item><item><title><![CDATA[石子合并/能量项链【区间dp】]]></title><link>https://blog.youkuaiyun.com/a6334167/article/details/101834882</link><guid>https://blog.youkuaiyun.com/a6334167/article/details/101834882</guid><author>a6334167</author><pubDate>Mon, 23 Sep 2019 20:30:00 +0800</pubDate><description><![CDATA[题目链接：http://www.51mxd.cn/problem.php-pid=737.htm
题目大意：给出n个石子堆以及这n个石子堆中石子数目，每次操作合并两个相邻的石子堆，代价为两个石子堆数目之和，求最后合成一个石子堆时所花费的最小代价。
解题思路：典型的区间dp


 1 #include&lt;stdio.h&gt;
 2 #include&lt;string.h...]]></description><category></category></item><item><title><![CDATA[【gcd】辗转相除法]]></title><link>https://blog.youkuaiyun.com/a6334167/article/details/101834876</link><guid>https://blog.youkuaiyun.com/a6334167/article/details/101834876</guid><author>a6334167</author><pubDate>Sat, 21 Sep 2019 17:23:00 +0800</pubDate><description><![CDATA[1 #include&lt;stdio.h&gt;
 2 
 3 int gcd(int a, int b)
 4 {
 5     int c;
 6     while(b)
 7     {
 8         c = a % b;
 9         a = b;
10         b = c;
11     }
12     return a...]]></description><category></category></item><item><title><![CDATA[Sightseeing tour 【混合图欧拉回路】]]></title><link>https://blog.youkuaiyun.com/a6334167/article/details/101834880</link><guid>https://blog.youkuaiyun.com/a6334167/article/details/101834880</guid><author>a6334167</author><pubDate>Sun, 15 Sep 2019 16:48:00 +0800</pubDate><description><![CDATA[题目链接：http://poj.org/problem?id=1637
Sightseeing tour




Time Limit:1000MS

Memory Limit:10000K


Total Submissions:10837

Accepted:4560




Description
The city executive...]]></description><category></category></item><item><title><![CDATA[find the mincost route【无向图最小环】]]></title><link>https://blog.youkuaiyun.com/a6334167/article/details/101834874</link><guid>https://blog.youkuaiyun.com/a6334167/article/details/101834874</guid><author>a6334167</author><pubDate>Fri, 13 Sep 2019 16:22:00 +0800</pubDate><description><![CDATA[题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1599
Problem Description
杭州有N个景区，景区之间有一些双向的路来连接，现在8600想找一条旅游路线，这个路线从A点出发并且最后回到A点，假设经过的路线为V1,V2,....VK,V1,那么必须满足K&gt;2,就是说至除了出发点以外至少要经过2个其他不同的景区，而且...]]></description><category></category></item><item><title><![CDATA[XKC's basketball team【线段树查询】]]></title><link>https://blog.youkuaiyun.com/a6334167/article/details/101834879</link><guid>https://blog.youkuaiyun.com/a6334167/article/details/101834879</guid><author>a6334167</author><pubDate>Mon, 09 Sep 2019 18:36:00 +0800</pubDate><description><![CDATA[XKC , the captain of the basketball team , is directing a train ofnnteam members. He makes all members stand in a row , and numbers them1 \cdots n1⋯nfrom left to right.
The ability of the...]]></description><category></category></item><item><title><![CDATA[关于最大匹配，最小点覆盖，最少路径覆盖和最大独立集的总结]]></title><link>https://blog.youkuaiyun.com/a6334167/article/details/101834870</link><guid>https://blog.youkuaiyun.com/a6334167/article/details/101834870</guid><author>a6334167</author><pubDate>Sun, 08 Sep 2019 14:35:00 +0800</pubDate><description><![CDATA[最小点覆盖：
点覆盖的概念定义：对于图G=(V,E)中的一个点覆盖是一个集合S⊆V使得每一条边至少有一个端点在S中。
最小点覆盖：就是点覆盖中点的个数最少的集合S。
最小边覆盖：
边覆盖的概念定义：边覆盖是图的一个边子集，使该图上每一节点都与这个边子集中的一条边关联，只有含孤立点的图没有边覆盖，边覆盖也称为边覆盖集，图G的最小边覆盖就是指边数最少的覆盖，图G的最小边覆盖的边数称为...]]></description><category></category></item><item><title><![CDATA[POJ2594 Treasure Exploration【DAG有向图可相交的最小路径覆盖】]]></title><link>https://blog.youkuaiyun.com/a6334167/article/details/101834877</link><guid>https://blog.youkuaiyun.com/a6334167/article/details/101834877</guid><author>a6334167</author><pubDate>Sat, 07 Sep 2019 17:25:00 +0800</pubDate><description><![CDATA[题目链接：http://poj.org/problem?id=2594
Treasure Exploration




Time Limit:6000MS

Memory Limit:65536K


Total Submissions:10480

Accepted:4250




Description
Have you ever ...]]></description><category></category></item><item><title><![CDATA[HDU3191 【输出次短路条数】]]></title><link>https://blog.youkuaiyun.com/a6334167/article/details/101834868</link><guid>https://blog.youkuaiyun.com/a6334167/article/details/101834868</guid><author>a6334167</author><pubDate>Sat, 07 Sep 2019 16:59:00 +0800</pubDate><description><![CDATA[题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=3191
How Many Paths Are There
Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2128Acce...]]></description><category></category></item><item><title><![CDATA[POJ1149 PIGS 【最大流 + 构图】]]></title><link>https://blog.youkuaiyun.com/a6334167/article/details/101834875</link><guid>https://blog.youkuaiyun.com/a6334167/article/details/101834875</guid><author>a6334167</author><pubDate>Sat, 07 Sep 2019 15:38:00 +0800</pubDate><description><![CDATA[题目链接：http://poj.org/problem?id=1149
PIGS




Time Limit:1000MS

Memory Limit:10000K


Total Submissions:24094

Accepted:10982




Description
Mirko works on a pig farm tha...]]></description><category></category></item><item><title><![CDATA[POJ2516 Minimum Cost【最小费用最大流】]]></title><link>https://blog.youkuaiyun.com/a6334167/article/details/101834866</link><guid>https://blog.youkuaiyun.com/a6334167/article/details/101834866</guid><author>a6334167</author><pubDate>Sat, 07 Sep 2019 11:22:00 +0800</pubDate><description><![CDATA[题目链接：http://poj.org/problem?id=2516
Minimum Cost




Time Limit:4000MS

Memory Limit:65536K


Total Submissions:19928

Accepted:7064




Description
Dearboy, a goods victu...]]></description><category></category></item><item><title><![CDATA[POJ3259 Wormholes 【spfa判负环】]]></title><link>https://blog.youkuaiyun.com/a6334167/article/details/101834872</link><guid>https://blog.youkuaiyun.com/a6334167/article/details/101834872</guid><author>a6334167</author><pubDate>Sat, 07 Sep 2019 10:59:00 +0800</pubDate><description><![CDATA[题目链接：http://poj.org/problem?id=3259
Wormholes




Time Limit:2000MS

Memory Limit:65536K


Total Submissions:75598

Accepted:28136




Description

While exploring his ma...]]></description><category></category></item><item><title><![CDATA[POJ3311 Hie with the Pie 【状压dp/TSP问题】]]></title><link>https://blog.youkuaiyun.com/a6334167/article/details/101834865</link><guid>https://blog.youkuaiyun.com/a6334167/article/details/101834865</guid><author>a6334167</author><pubDate>Sat, 07 Sep 2019 10:46:00 +0800</pubDate><description><![CDATA[题目链接：http://poj.org/problem?id=3311
Hie with the Pie




Time Limit:2000MS

Memory Limit:65536K


Total Submissions:12225

Accepted:6441




Description

The Pizazz Pizze...]]></description><category></category></item><item><title><![CDATA[Holy Grail【spfa求最短路】]]></title><link>https://blog.youkuaiyun.com/a6334167/article/details/101834863</link><guid>https://blog.youkuaiyun.com/a6334167/article/details/101834863</guid><author>a6334167</author><pubDate>Mon, 02 Sep 2019 19:21:00 +0800</pubDate><description><![CDATA[题目链接：https://www.jisuanke.com/contest/3004?view=challenges
题目大意：
1.一个无向图，给出六个顶点，添六条边，但是添边是有限制的。每次添边的权值要最小。
2.不能构成negative-weighted loop，negative-weighted loop指的是循环加权和为负，即从一个顶点出发在回到这个顶点的经过路径的权值...]]></description><category></category></item><item><title><![CDATA[双端队列 【deque】]]></title><link>https://blog.youkuaiyun.com/a6334167/article/details/101834869</link><guid>https://blog.youkuaiyun.com/a6334167/article/details/101834869</guid><author>a6334167</author><pubDate>Mon, 12 Aug 2019 12:22:00 +0800</pubDate><description><![CDATA[题目链接：https://ac.nowcoder.com/acm/contest/1071/D
还是第一次简单运用双端队列。顾名思义：队列的头尾都可以进行插入跟删除操作。
存在于头文件 deque 中。


 1 #include&lt;iostream&gt;
 2 #include&lt;deque&gt;
 3 #include&lt;string.h&gt;
 4...]]></description><category></category></item><item><title><![CDATA[HDU6582 Path【优先队列优化最短路 + dinic最大流 == 最小割】]]></title><link>https://blog.youkuaiyun.com/a6334167/article/details/101834803</link><guid>https://blog.youkuaiyun.com/a6334167/article/details/101834803</guid><author>a6334167</author><pubDate>Mon, 12 Aug 2019 12:08:00 +0800</pubDate><description><![CDATA[题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=6582
来源：2019 Multi-University Training Contest 1
题目大意：
给定一张有向图，可以阻碍若干条有向边，花费为边的权值，求使其最短路变得更长所需的最小花费。
解题思路：
1.因为最短路可能是多条，所以找出最短路网络，然后在最短路网络中跑最小割...]]></description><category></category></item><item><title><![CDATA[Orderly Class]]></title><link>https://blog.youkuaiyun.com/a6334167/article/details/101834804</link><guid>https://blog.youkuaiyun.com/a6334167/article/details/101834804</guid><author>a6334167</author><pubDate>Mon, 05 Aug 2019 10:46:00 +0800</pubDate><description><![CDATA[题目链接：
https://nanti.jisuanke.com/t/40449
题目大意：给出两个长度相同的不同字符串A, B.可以对A的任意长度区间进行一次翻转，问有多少种方法可以使得翻转后两字符串相同。
思路：
1.一开始我是利用string以及algorithm头文件里的reverse()来做的，毫无疑问超时了。其实我知道这种题目一定是有什么特定的算法或者思路。很可惜第一...]]></description><category></category></item></channel></rss>