<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Monica]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/NOIAu</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; NOIAu]]></copyright><item><title><![CDATA[一句话详细题解+优质题目及其博客（清真代码）链接 （持续更新）+知识点讲解汇总]]></title><link>https://blog.youkuaiyun.com/NOIAu/article/details/78262071</link><guid>https://blog.youkuaiyun.com/NOIAu/article/details/78262071</guid><author>NOIAu</author><pubDate>Tue, 17 Oct 2017 16:34:38 +0800</pubDate><description><![CDATA[CODEVS
NOI2002 贪吃的九头蛇 codevs 1746题解：树形DP，发现当”小头”大于等于2的时候，我们可以让小头们交替地去吃果子，比如son让小头A吃，可以让小头B吃father，让小头A吃grandfather，再让小头B吃grandgrandfather…所以我们发现其实只和”大头”吃那些点有关，所以我们定义dp[i][j][k]表示当前在位置i，i的子树里面大头吃j个，其中位置]]></description><category></category></item><item><title><![CDATA[BZOJ 2427: [HAOI2010]软件安装 Tarjan缩点 + DP]]></title><link>https://blog.youkuaiyun.com/NOIAu/article/details/78230934</link><guid>https://blog.youkuaiyun.com/NOIAu/article/details/78230934</guid><author>NOIAu</author><pubDate>Fri, 13 Oct 2017 22:14:30 +0800</pubDate><description><![CDATA[Time Limit: 10 Sec  Memory Limit: 128 MB 
Submit: 1628  Solved: 635Description现在我们的手头有N个软件，对于一个软件i，它要占用Wi的磁盘空间，它的价值为Vi。我们希望从中选择一些软件安装到一台磁盘容量为M计算机上，使得这些软件的价值尽可能大（即Vi的和最大）。但是现在有个问题：软件之间存在依赖关系，即软件i只有在安装了软]]></description><category></category></item><item><title><![CDATA[BZOJ 2730: [HNOI2012]矿场搭建 割点 + 乘法原理]]></title><link>https://blog.youkuaiyun.com/NOIAu/article/details/78230168</link><guid>https://blog.youkuaiyun.com/NOIAu/article/details/78230168</guid><author>NOIAu</author><pubDate>Fri, 13 Oct 2017 20:34:40 +0800</pubDate><description><![CDATA[Time Limit: 10 Sec  Memory Limit: 128 MB 
Submit: 2362  Solved: 1093Description煤矿工地可以看成是由隧道连接挖煤点组成的无向图。为安全起见，希望在工地发生事故时所有挖煤点的工人都能有一条出路逃到救援出口处。于是矿主决定在某些挖煤点设立救援出口，使得无论哪一个挖煤点坍塌之后，其他挖煤点的工人都有一条道路通向救援出口。请写一个]]></description><category></category></item><item><title><![CDATA[HDU 4738 Caocao's Bridges 求桥 诸葛亮带着炸弹跑路了]]></title><link>https://blog.youkuaiyun.com/NOIAu/article/details/78229463</link><guid>https://blog.youkuaiyun.com/NOIAu/article/details/78229463</guid><author>NOIAu</author><pubDate>Fri, 13 Oct 2017 18:58:59 +0800</pubDate><description><![CDATA[DescriptionCaocao was defeated by Zhuge Liang and Zhou Yu in the battle of Chibi. But he wouldn’t give up. Caocao’s army still was not good at water battles, so he came up with another idea. He built m]]></description><category></category></item><item><title><![CDATA[POJ 1144 Network 裸割点]]></title><link>https://blog.youkuaiyun.com/NOIAu/article/details/78225534</link><guid>https://blog.youkuaiyun.com/NOIAu/article/details/78225534</guid><author>NOIAu</author><pubDate>Fri, 13 Oct 2017 14:19:59 +0800</pubDate><description><![CDATA[题意：给一个图，求割点个数#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
const int MAXN = 110;
int low[MAXN], dfn[MAXN], head[MAXN], tail, cnt, timer, n;
struct Line{ int to, nxt; }li]]></description><category></category></item><item><title><![CDATA[BZOJ 1097: [POI2007]旅游景点atr 最短路 堆优Dijkstra 状压]]></title><link>https://blog.youkuaiyun.com/NOIAu/article/details/78224603</link><guid>https://blog.youkuaiyun.com/NOIAu/article/details/78224603</guid><author>NOIAu</author><pubDate>Fri, 13 Oct 2017 12:20:12 +0800</pubDate><description><![CDATA[Time Limit: 30 Sec  Memory Limit: 357 MB 
Submit: 2021  Solved: 515Description　　FGD想从成都去上海旅游。在旅途中他希望经过一些城市并在那里欣赏风景，品尝风味小吃或者做其他的有趣 
的事情。经过这些城市的顺序不是完全随意的，比如说FGD不希望在刚吃过一顿大餐之后立刻去下一个城市登山， 
而是希望去另外什么地方喝下午茶。幸]]></description><category></category></item><item><title><![CDATA[BZOJ 1375: [Baltic2002]Bicriterial routing 双调路径 SPFA+DP思想]]></title><link>https://blog.youkuaiyun.com/NOIAu/article/details/78222748</link><guid>https://blog.youkuaiyun.com/NOIAu/article/details/78222748</guid><author>NOIAu</author><pubDate>Fri, 13 Oct 2017 10:13:05 +0800</pubDate><description><![CDATA[Time Limit: 5 Sec  Memory Limit: 64 MB 
Submit: 513  Solved: 189Description来越多，因此选择最佳路径是很现实的问题。城市的道路是双向的，每条道路有固定的旅行时间以及需要支付的费用。路径由连续的道路组成。总时间是各条道路旅行时间的和，总费用是各条道路所支付费用的总和。同样的出发地和目的地，如果路径A比路径B所需时间少且费用低，那]]></description><category></category></item><item><title><![CDATA[POJ 3159 Candies 差分约束系统（这题卡SPFA的队列的双端队列）]]></title><link>https://blog.youkuaiyun.com/NOIAu/article/details/78221860</link><guid>https://blog.youkuaiyun.com/NOIAu/article/details/78221860</guid><author>NOIAu</author><pubDate>Fri, 13 Oct 2017 09:04:09 +0800</pubDate><description><![CDATA[DescriptionDuring 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 the]]></description><category></category></item><item><title><![CDATA[PoJ 2983  Is the Information Reliable? 差分约束系统]]></title><link>https://blog.youkuaiyun.com/NOIAu/article/details/78220586</link><guid>https://blog.youkuaiyun.com/NOIAu/article/details/78220586</guid><author>NOIAu</author><pubDate>Thu, 12 Oct 2017 22:18:00 +0800</pubDate><description><![CDATA[DescriptionThe galaxy war between the Empire Draco and the Commonwealth of Zibu broke out 3 years ago. Draco established a line of defense called Grot. Grot is a straight line with N defense stations.]]></description><category></category></item><item><title><![CDATA[POJ 1364 King 差分约束系统]]></title><link>https://blog.youkuaiyun.com/NOIAu/article/details/78218469</link><guid>https://blog.youkuaiyun.com/NOIAu/article/details/78218469</guid><author>NOIAu</author><pubDate>Thu, 12 Oct 2017 19:04:36 +0800</pubDate><description><![CDATA[DescriptionOnce, in one kingdom, there was a queen and that queen was expecting a baby. The queen prayed: “If my child was a son and if only he was a sound king.” After nine months her child was born,]]></description><category></category></item><item><title><![CDATA[POJ 1201 Intervals 差分约束系统]]></title><link>https://blog.youkuaiyun.com/NOIAu/article/details/78217010</link><guid>https://blog.youkuaiyun.com/NOIAu/article/details/78217010</guid><author>NOIAu</author><pubDate>Thu, 12 Oct 2017 16:59:44 +0800</pubDate><description><![CDATA[Time Limit: 2000MS      Memory Limit: 65536K 
Total Submissions: 27889        Accepted: 10743DescriptionYou are given n closed, integer intervals [ai, bi] and n integers c1, …, cn.  
Write a program th]]></description><category></category></item><item><title><![CDATA[P1073 最优贸易 NOIP 2009 最短路]]></title><link>https://blog.youkuaiyun.com/NOIAu/article/details/78214788</link><guid>https://blog.youkuaiyun.com/NOIAu/article/details/78214788</guid><author>NOIAu</author><pubDate>Thu, 12 Oct 2017 14:48:57 +0800</pubDate><description><![CDATA[题目描述C 国有 n 个大城市和 m 条道路，每条道路连接这 n 个城市中的某两个城市。任意两个城市之间最多只有一条道路直接相连。这 m 条道路中有一部分为单向通行的道路，一部分为双向通行的道路，双向通行的道路在统计条数时也计为 1 条。C 国幅员辽阔，各地的资源分布情况各不相同，这就导致了同一种商品在不同城市的价格不一定相同。但是，同一种商品在同一个城市的买入价和卖出价始终是相同的。商人阿龙来到]]></description><category></category></item><item><title><![CDATA[BZOJ 4562: [Haoi2016]食物链 拓扑排序+DP（其实是递推）]]></title><link>https://blog.youkuaiyun.com/NOIAu/article/details/78209213</link><guid>https://blog.youkuaiyun.com/NOIAu/article/details/78209213</guid><author>NOIAu</author><pubDate>Wed, 11 Oct 2017 22:18:54 +0800</pubDate><description><![CDATA[Time Limit: 10 Sec  Memory Limit: 128 MB 
Submit: 744  Solved: 458Description如图所示为某生态系统的食物网示意图，据图回答第1小题 
现在给你n个物种和m条能量流动关系，求其中的食物链条数。 
物种的名称为从1到n编号 
M条能量流动关系形如 
a1 b1 
a2 b2 
a3 b3 
…… 
am-1 bm-1 
am b]]></description><category></category></item><item><title><![CDATA[PoJ 1041 John's trip 神奇操作DFS]]></title><link>https://blog.youkuaiyun.com/NOIAu/article/details/78209106</link><guid>https://blog.youkuaiyun.com/NOIAu/article/details/78209106</guid><author>NOIAu</author><pubDate>Wed, 11 Oct 2017 22:09:38 +0800</pubDate><description><![CDATA[Time Limit: 1000MS      Memory Limit: 65536K 
Total Submissions: 9284     Accepted: 3116      Special JudgeDescriptionLittle Johnny has got a new car. He decided to drive around the town to visit his f]]></description><category></category></item><item><title><![CDATA[BZOJ 2064: 分裂 状压DP]]></title><link>https://blog.youkuaiyun.com/NOIAu/article/details/78208814</link><guid>https://blog.youkuaiyun.com/NOIAu/article/details/78208814</guid><author>NOIAu</author><pubDate>Wed, 11 Oct 2017 21:40:47 +0800</pubDate><description><![CDATA[Time Limit: 10 Sec  Memory Limit: 64 MB 
Submit: 540  Solved: 332Description背景： 和久必分，分久必和。。。 题目描述： 中国历史上上分分和和次数非常多。。通读中国历史的WJMZBMR表示毫无压力。 同时经常搞OI的他把这个变成了一个数学模型。 假设中国的国土总和是不变的。 每个国家都可以用他的国土面积代替， 又两种可能，一]]></description><category></category></item><item><title><![CDATA[BZOJ 4145: [AMPPZ2014]The Prices]]></title><link>https://blog.youkuaiyun.com/NOIAu/article/details/78208554</link><guid>https://blog.youkuaiyun.com/NOIAu/article/details/78208554</guid><author>NOIAu</author><pubDate>Wed, 11 Oct 2017 21:18:27 +0800</pubDate><description><![CDATA[Time Limit: 20 Sec  Memory Limit: 256 MB 
Submit: 468  Solved: 310Description你要购买m种物品各一件，一共有n家商店，你到第i家商店的路费为d[i]，在第i家商店购买第j种物品的费用为c[i][j]， 
求最小总费用。Input第一行包含两个正整数n,m(1<=n<=100,1<=m<=16)，表示商店数和物品数。 
接下来]]></description><category></category></item><item><title><![CDATA[欧拉回路 欧拉路径某些问题集合]]></title><link>https://blog.youkuaiyun.com/NOIAu/article/details/78205262</link><guid>https://blog.youkuaiyun.com/NOIAu/article/details/78205262</guid><author>NOIAu</author><pubDate>Wed, 11 Oct 2017 16:31:46 +0800</pubDate><description><![CDATA[后续会给出一些代码
问题一：
  n个点，m个双向边，无重边，可能有自环，一条航线需要满足以下要求：从任意一个点出发，在任意一个点结束，经过m-2条边恰好2次，经过2条边恰好1次。求有多少本质不同的航线，两航线本质不同当且仅当存在1条边，在两航线中经过次数不同。
N ≤ 1e5 , M ≤ 1e5.首先这道题要判连通图，这个没问题然后这道题因为是无向图，而且可以有自环，所以我们的DP不是很好搞，于是]]></description><category></category></item><item><title><![CDATA[浅谈Fleury(佛罗莱)算法 欧拉回路（及路径）]]></title><link>https://blog.youkuaiyun.com/NOIAu/article/details/78203851</link><guid>https://blog.youkuaiyun.com/NOIAu/article/details/78203851</guid><author>NOIAu</author><pubDate>Wed, 11 Oct 2017 15:07:00 +0800</pubDate><description><![CDATA[首先复习一下欧拉回路（及路径）的几个基础概念与定理
FirstFirst
  欧拉回路：是指所有的边都只经过一次且仅一次，并且要走回到出发点的一条路径 
  欧拉路径：表示一条不需要回到出发点，但是必须经过所有的边且都只经过一次的路径
SecondSecond
  无向图存在欧拉回路的充要条件是所有的点的度数均为偶数 
  无向图存在欧拉路径的充要条件是度数为奇数的点的数量为00个或者22个]]></description><category></category></item><item><title><![CDATA[POJ 3254 Corn Fields 状压DP]]></title><link>https://blog.youkuaiyun.com/NOIAu/article/details/78199496</link><guid>https://blog.youkuaiyun.com/NOIAu/article/details/78199496</guid><author>NOIAu</author><pubDate>Wed, 11 Oct 2017 08:36:21 +0800</pubDate><description><![CDATA[Time Limit: 2000MS      Memory Limit: 65536K 
Total Submissions: 6321     Accepted: 3361DescriptionFarmer John has purchased a lush new rectangular pasture composed of M by N (1 ≤ M ≤ 12; 1 ≤ N ≤ 12) s]]></description><category></category></item><item><title><![CDATA[BZOJ 3566: [SHOI2014]概率充电器 期望DP + 树形DP]]></title><link>https://blog.youkuaiyun.com/NOIAu/article/details/78196468</link><guid>https://blog.youkuaiyun.com/NOIAu/article/details/78196468</guid><author>NOIAu</author><pubDate>Tue, 10 Oct 2017 19:38:59 +0800</pubDate><description><![CDATA[Time Limit: 40 Sec  Memory Limit: 256 MB 
Submit: 1276  Solved: 558Description著名的电子产品品牌 SHOI 刚刚发布了引领世界潮流的下一代电子产品——概率充电器: 
“采用全新纳米级加工技术,实现元件与导线能否通电完全由真随机数决定!SHOI 概率充电器,您生活不可或缺的必需品!能充上电吗?现在就试试看吧! 
” 
SHO]]></description><category></category></item></channel></rss>