<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[unknown]]></title><description><![CDATA[终日抄代码,沉迷学习,日渐消瘦...]]></description><link>https://blog.youkuaiyun.com/ivy_uu</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ivy_uu]]></copyright><item><title><![CDATA[模拟赛 不等数列]]></title><link>https://blog.youkuaiyun.com/ivy_uu/article/details/79413956</link><guid>https://blog.youkuaiyun.com/ivy_uu/article/details/79413956</guid><author>ivy_uu</author><pubDate>Thu, 01 Mar 2018 16:11:14 +0800</pubDate><description><![CDATA[problem 2 不等数列(num.cpp/c/pas) 
【题目描述】 
将1到n任意排列，然后在排列的每两个数之间根据他们的大小关系插入“&amp;gt;”和“&amp;lt;”。问在所有排列中，有多少个排列恰好有k个“&amp;lt;”。答案对2012取模。

【输入格式】 
第一行2个整数n,k。

【输出格式】 
一个整数表示答案。

【样例输入】 
5 2 
【样例输出】 
66 
【数据范围】 
对于30...]]></description><category></category></item><item><title><![CDATA[BZOJ 2467 中山市选2010 生成树 组合数学]]></title><link>https://blog.youkuaiyun.com/ivy_uu/article/details/79410048</link><guid>https://blog.youkuaiyun.com/ivy_uu/article/details/79410048</guid><author>ivy_uu</author><pubDate>Thu, 01 Mar 2018 11:21:32 +0800</pubDate><description><![CDATA[

有一个五边形a必须得选两条边，另外的五边形选一条边，且a必须选择中心n边形的一条边，分两步考虑，一步是a有n种选法，一步是a选择边的方法为：中心多边形必选一条，其余4条边选一种。 
4*n 
除a的五边形每人选一条，任意选是5^(n-1). 
结论是4n*5^(n-1) 
http://blog.youkuaiyun.com/PoPoQQQ/article/details/41348131...]]></description><category></category></item><item><title><![CDATA[树状数组优化LIS]]></title><link>https://blog.youkuaiyun.com/ivy_uu/article/details/79397374</link><guid>https://blog.youkuaiyun.com/ivy_uu/article/details/79397374</guid><author>ivy_uu</author><pubDate>Wed, 28 Feb 2018 10:38:19 +0800</pubDate><description><![CDATA[树状数组优化LIS]]></description><category></category></item><item><title><![CDATA[选课]]></title><link>https://blog.youkuaiyun.com/ivy_uu/article/details/79390854</link><guid>https://blog.youkuaiyun.com/ivy_uu/article/details/79390854</guid><author>ivy_uu</author><pubDate>Tue, 27 Feb 2018 17:10:37 +0800</pubDate><description><![CDATA[dp(int u)
{
    //不考虑根节点，以u为根节点的子树选择关系(0表示可以不选子树) 
    for(int i=head[u];i;i=edge[i].nxt)
    {
        int v=edge[i].to;
        dp(v);//求它所有的子节点 
        for(int t=m;t&amp;gt;=0;t--)
            for(int...]]></description><category></category></item><item><title><![CDATA[银河英雄传说]]></title><link>https://blog.youkuaiyun.com/ivy_uu/article/details/79294821</link><guid>https://blog.youkuaiyun.com/ivy_uu/article/details/79294821</guid><author>ivy_uu</author><pubDate>Fri, 09 Feb 2018 07:10:05 +0800</pubDate><description><![CDATA[//分两棵树，第二棵树dis[i]+dis[f[i]]曾经的父亲，
1(到曾经的父亲距离)+5 (曾经的父亲到当下的父亲的距离)
#include&amp;lt;cstdio&amp;gt;
#include&amp;lt;iostream&amp;gt;
#include&amp;lt;algorithm&amp;gt;
using namespace std;
const int M=30000;
int t;
int f[M+10],di...]]></description><category></category></item><item><title><![CDATA[luogu1892]]></title><link>https://blog.youkuaiyun.com/ivy_uu/article/details/78942011</link><guid>https://blog.youkuaiyun.com/ivy_uu/article/details/78942011</guid><author>ivy_uu</author><pubDate>Sun, 31 Dec 2017 15:37:11 +0800</pubDate><description><![CDATA[并查集补集]]></description><category></category></item><item><title><![CDATA[欧拉函数]]></title><link>https://blog.youkuaiyun.com/ivy_uu/article/details/78920727</link><guid>https://blog.youkuaiyun.com/ivy_uu/article/details/78920727</guid><author>ivy_uu</author><pubDate>Thu, 28 Dec 2017 12:21:22 +0800</pubDate><description><![CDATA[欧拉函数]]></description><category></category></item><item><title><![CDATA[莫比乌斯反演入门]]></title><link>https://blog.youkuaiyun.com/ivy_uu/article/details/78880671</link><guid>https://blog.youkuaiyun.com/ivy_uu/article/details/78880671</guid><author>ivy_uu</author><pubDate>Sat, 23 Dec 2017 16:27:31 +0800</pubDate><description><![CDATA[https://www.cnblogs.com/chenyang920/p/4811995.html我们先令  S,X 都表示集合 比如 S={a,b,c} X={b} 等  并令|S|表示 S中元素的个数接着定义 集合上的函数 F(S)    为F(S)=|S| 然后再定义 G(S)=sigma(F(X)) (其中X是S的子集)   {这里也是一种包含关系，集合的包含！！}举个例子: 
S={a,]]></description><category></category></item><item><title><![CDATA[烦人的幻灯片]]></title><link>https://blog.youkuaiyun.com/ivy_uu/article/details/78878738</link><guid>https://blog.youkuaiyun.com/ivy_uu/article/details/78878738</guid><author>ivy_uu</author><pubDate>Sat, 23 Dec 2017 10:56:06 +0800</pubDate><description><![CDATA[类似拓扑排序方式]]></description><category></category></item><item><title><![CDATA[2015Day1T2信息传递]]></title><link>https://blog.youkuaiyun.com/ivy_uu/article/details/78864142</link><guid>https://blog.youkuaiyun.com/ivy_uu/article/details/78864142</guid><author>ivy_uu</author><pubDate>Thu, 21 Dec 2017 15:19:32 +0800</pubDate><description><![CDATA[bfs和dfs//求最小环 
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int n,u,y,cnt,mn=0x3fffffff,c,t,p;
int head[200005],col[200005],st[200005];
int bc[200005],b[200005],cn[200005]]]></description><category></category></item><item><title><![CDATA[【BZOJ】初级水题列表——献给那些想要进军BZOJ的OIers]]></title><link>https://blog.youkuaiyun.com/ivy_uu/article/details/78836934</link><guid>https://blog.youkuaiyun.com/ivy_uu/article/details/78836934</guid><author>ivy_uu</author><pubDate>Mon, 18 Dec 2017 20:38:03 +0800</pubDate><description><![CDATA[【BZOJ】初级水题列表——献给那些想要进军BZOJ的OIers 
http://blog.youkuaiyun.com/eolv99/article/details/39578977]]></description><category></category></item><item><title><![CDATA[一元二次方程]]></title><link>https://blog.youkuaiyun.com/ivy_uu/article/details/78802504</link><guid>https://blog.youkuaiyun.com/ivy_uu/article/details/78802504</guid><author>ivy_uu</author><pubDate>Thu, 14 Dec 2017 14:42:29 +0800</pubDate><description><![CDATA[语言基础 精度]]></description><category></category></item><item><title><![CDATA[P1717钓鱼]]></title><link>https://blog.youkuaiyun.com/ivy_uu/article/details/78736156</link><guid>https://blog.youkuaiyun.com/ivy_uu/article/details/78736156</guid><author>ivy_uu</author><pubDate>Wed, 06 Dec 2017 22:38:26 +0800</pubDate><description><![CDATA[优先队列**]]></description><category></category></item><item><title><![CDATA[树专题]]></title><link>https://blog.youkuaiyun.com/ivy_uu/article/details/78665189</link><guid>https://blog.youkuaiyun.com/ivy_uu/article/details/78665189</guid><author>ivy_uu</author><pubDate>Wed, 29 Nov 2017 14:42:04 +0800</pubDate><description><![CDATA[树专题]]></description><category></category></item><item><title><![CDATA[Noip2017 Day2T1 cheese]]></title><link>https://blog.youkuaiyun.com/ivy_uu/article/details/78647790</link><guid>https://blog.youkuaiyun.com/ivy_uu/article/details/78647790</guid><author>ivy_uu</author><pubDate>Mon, 27 Nov 2017 18:41:09 +0800</pubDate><description><![CDATA[爆搜，dfs基础练习题,double类型]]></description><category></category></item><item><title><![CDATA[Day1T1]]></title><link>https://blog.youkuaiyun.com/ivy_uu/article/details/78554456</link><guid>https://blog.youkuaiyun.com/ivy_uu/article/details/78554456</guid><author>ivy_uu</author><pubDate>Thu, 16 Nov 2017 19:12:59 +0800</pubDate><description><![CDATA[题目内容：]]></description><category></category></item><item><title><![CDATA[图的深搜]]></title><link>https://blog.youkuaiyun.com/ivy_uu/article/details/78492066</link><guid>https://blog.youkuaiyun.com/ivy_uu/article/details/78492066</guid><author>ivy_uu</author><pubDate>Thu, 09 Nov 2017 17:29:10 +0800</pubDate><description><![CDATA[图论 深搜 第一题]]></description><category></category></item><item><title><![CDATA[最长上升子序列 记忆化讲解]]></title><link>https://blog.youkuaiyun.com/ivy_uu/article/details/78417189</link><guid>https://blog.youkuaiyun.com/ivy_uu/article/details/78417189</guid><author>ivy_uu</author><pubDate>Wed, 01 Nov 2017 18:43:15 +0800</pubDate><description><![CDATA[记忆化搜索**]]></description><category></category></item><item><title><![CDATA[NOIP历届题目分类]]></title><link>https://blog.youkuaiyun.com/ivy_uu/article/details/78410253</link><guid>https://blog.youkuaiyun.com/ivy_uu/article/details/78410253</guid><author>ivy_uu</author><pubDate>Wed, 01 Nov 2017 09:08:36 +0800</pubDate><description><![CDATA[NOIP历届题目分类]]></description><category></category></item><item><title><![CDATA[P1755 斐波那契的拆分]]></title><link>https://blog.youkuaiyun.com/ivy_uu/article/details/78410143</link><guid>https://blog.youkuaiyun.com/ivy_uu/article/details/78410143</guid><author>ivy_uu</author><pubDate>Wed, 01 Nov 2017 08:55:43 +0800</pubDate><description><![CDATA[深度搜索*]]></description><category></category></item></channel></rss>