<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Chter0的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Chter0</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Chter0]]></copyright><item><title><![CDATA[UVA - 12295  最短路+递推]]></title><link>https://blog.youkuaiyun.com/Chter0/article/details/105276312</link><guid>https://blog.youkuaiyun.com/Chter0/article/details/105276312</guid><author>Chter0</author><pubDate>Thu, 02 Apr 2020 18:30:50 +0800</pubDate><description><![CDATA[有一个n*n的矩阵，要求从（1，1）到（n，n）的最短路数量，路径的权值是所经过元素的和，且路径与对角线对称。

由于路径是对称的，可以先预处理将右下角的元素加到左上角，那么就只用计算（1，1）到对角线的最短路数量了，计算最短路可以用dijkstra，要计算数量只需要在dijkstra的过程中递推一下就好了。


#include&lt;cstdio&gt;
#include&lt;vector&...]]></description><category></category></item><item><title><![CDATA[FZU - 2205]]></title><link>https://blog.youkuaiyun.com/Chter0/article/details/105258113</link><guid>https://blog.youkuaiyun.com/Chter0/article/details/105258113</guid><author>Chter0</author><pubDate>Wed, 01 Apr 2020 22:59:59 +0800</pubDate><description><![CDATA[有n个点，要求连最多的双向边使图中不存在任意三个点直接连接

可以考虑将n个点分为两个集合，分别有a,b个点，则n=a+b，相同集合的点不连接，不同集合的点全连接，则边数c=a*b，根据均值不等式可以知道当n为偶数时a=b=n/2，c最大，当n为奇数时a=n/2，b=n/2+1，c最大。


#include&lt;cstdio&gt;
#include&lt;vector&gt;
#includ...]]></description><category></category></item><item><title><![CDATA[欧拉降幂公式与证明]]></title><link>https://blog.youkuaiyun.com/Chter0/article/details/103458581</link><guid>https://blog.youkuaiyun.com/Chter0/article/details/103458581</guid><author>Chter0</author><pubDate>Mon, 09 Dec 2019 15:19:53 +0800</pubDate><description><![CDATA[欧拉降幂公式与证明
转载自D-Tesla
欧拉降幂公式
AK≡AK%ϕ(m)+ϕ(m)(&nbsp;mod&nbsp;m)  K&gt;ϕ(m)A^K\equiv A^{K \%\phi(m) +\phi(m)}(\ mod\ m)\qquad \; K &gt; \phi(m)AK≡AK%ϕ(m)+ϕ(m)(&nbsp;mod&nbsp;m)K&gt;ϕ(m)
证明
今天在牛客多校的群里看一个数...]]></description><category></category></item><item><title><![CDATA[二分图匹配总结]]></title><link>https://blog.youkuaiyun.com/Chter0/article/details/103385498</link><guid>https://blog.youkuaiyun.com/Chter0/article/details/103385498</guid><author>Chter0</author><pubDate>Wed, 04 Dec 2019 14:03:06 +0800</pubDate><description><![CDATA[二分图匹配

关键在于如何建图

哪些问题可以用二分图匹配：

题目中明确给出了两两关系，寻找满足关系最大组数。
	题目没给出明确的关系，但可以寻找内在的关系建立二分图求解。


哪些关系可以建立二分图求解：

题目明确给出两组顶点以及之间的关系HDU - 1083
	题目给出一组顶点以及之间的关系，且满足二分图的特性HDU - 2444
	二维坐标轴中的行和列匹配 HDU - 1045
	插入...]]></description><category></category></item><item><title><![CDATA[二分图最小点覆盖=最大匹配数 证明]]></title><link>https://blog.youkuaiyun.com/Chter0/article/details/103376588</link><guid>https://blog.youkuaiyun.com/Chter0/article/details/103376588</guid><author>Chter0</author><pubDate>Tue, 03 Dec 2019 21:38:03 +0800</pubDate><description><![CDATA[在二分图中，我们可以把最小点覆盖理解为去掉图中尽可能少的点使得图中的边数为零。P1为需要去掉的点的集合，P2为不需要去掉的点的集合，点u属于集合P1，点v属于集合P2。P2中必定不存在边，否则与使得边数为零的思想矛盾。对于任意的u必定存在至少一条边使得u与P2相连，因为如果没有任何边使得u与P2相连，我们就没必要去掉u，与尽可能少的去掉点的思想矛盾。我们将图中的点两两配对，配对的关系可以分为三种情...]]></description><category></category></item><item><title><![CDATA[HDU - 2389  二分图HK算法（记个模板）]]></title><link>https://blog.youkuaiyun.com/Chter0/article/details/103291838</link><guid>https://blog.youkuaiyun.com/Chter0/article/details/103291838</guid><author>Chter0</author><pubDate>Thu, 28 Nov 2019 13:35:17 +0800</pubDate><description><![CDATA[推荐博客：https://blog.youkuaiyun.com/qq_43202683/article/details/89113604

You’re giving a party in the garden of your villa by the sea. The party is a huge success, and everyone is here. It’s a warm, sunny eve...]]></description><category></category></item><item><title><![CDATA[Fire Net HDU - 1045 二分图匹配]]></title><link>https://blog.youkuaiyun.com/Chter0/article/details/103240207</link><guid>https://blog.youkuaiyun.com/Chter0/article/details/103240207</guid><author>Chter0</author><pubDate>Mon, 25 Nov 2019 16:18:01 +0800</pubDate><description><![CDATA[Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall.

A blockhouse is a small castle t...]]></description><category></category></item><item><title><![CDATA[Restore Permutation CodeForces - 1208D]]></title><link>https://blog.youkuaiyun.com/Chter0/article/details/103018499</link><guid>https://blog.youkuaiyun.com/Chter0/article/details/103018499</guid><author>Chter0</author><pubDate>Mon, 11 Nov 2019 21:31:59 +0800</pubDate><description><![CDATA[An array of integersp1,p2,…,pnp1,p2,…,pnis called a permutation if it contains each number from11tonnexactly once. For example, the following arrays are permutations:[3,1,2],[1],[1,2,3,4,5][3,1...]]></description><category></category></item><item><title><![CDATA[Fansblog  HDU - 6608]]></title><link>https://blog.youkuaiyun.com/Chter0/article/details/103008783</link><guid>https://blog.youkuaiyun.com/Chter0/article/details/103008783</guid><author>Chter0</author><pubDate>Mon, 11 Nov 2019 13:51:19 +0800</pubDate><description><![CDATA[Farmer John keeps a website called ‘FansBlog’ .Everyday , there are many people visited this blog.One day, he find the visits has reached P , which is a prime number.He thinks it is a interesting fact...]]></description><category></category></item><item><title><![CDATA[约会安排 HDU 4553 双线段树+区间合并+区间索引]]></title><link>https://blog.youkuaiyun.com/Chter0/article/details/89480857</link><guid>https://blog.youkuaiyun.com/Chter0/article/details/89480857</guid><author>Chter0</author><pubDate>Wed, 16 Oct 2019 21:18:39 +0800</pubDate><description><![CDATA[约会安排

HDU 4553  https://vjudge.net/contest/293027#problem/L

注意区间索引方法和Lazy标记的优先级

　　寒假来了，又到了小明和女神们约会的季节。
　　小明虽为屌丝级码农，但非常活跃，女神们常常在小明网上的大段发言后热情回复“呵呵”，所以，小明的最爱就是和女神们约会。与此同时，也有很多基友找他开黑，由于数量实在过于巨大，怎么安...]]></description><category></category></item><item><title><![CDATA[Vases and Flowers  线段树+二分]]></title><link>https://blog.youkuaiyun.com/Chter0/article/details/89678324</link><guid>https://blog.youkuaiyun.com/Chter0/article/details/89678324</guid><author>Chter0</author><pubDate>Wed, 16 Oct 2019 21:17:54 +0800</pubDate><description><![CDATA[Vases and Flowers



Alice有N个花瓶（标号为0~N-1）。当她收到一些花时，她会随机的选择一个瓶子A，从它开始遍历A，A+1, A+2, ..., N-1号瓶子，遇到空瓶子就放一朵花进去，直到花朵放完或没有瓶子，剩下的花将被丢弃。有时，她也会清理标号从A到B的花瓶(A &lt;= B).花瓶里的花会被丢弃。

Input

　　第一行一个整数T，表示数据组数。
　...]]></description><category></category></item><item><title><![CDATA[多操作线段树]]></title><link>https://blog.youkuaiyun.com/Chter0/article/details/89678571</link><guid>https://blog.youkuaiyun.com/Chter0/article/details/89678571</guid><author>Chter0</author><pubDate>Wed, 16 Oct 2019 21:17:05 +0800</pubDate><description><![CDATA[Transformation



Yuanfang is puzzled with the question below:
There are n integers, a1, a2, …, an. The initial values of them are 0. There are four kinds of operations.
Operation 1: Add c to ea...]]></description><category></category></item><item><title><![CDATA[DP分析记录]]></title><link>https://blog.youkuaiyun.com/Chter0/article/details/89816606</link><guid>https://blog.youkuaiyun.com/Chter0/article/details/89816606</guid><author>Chter0</author><pubDate>Wed, 16 Oct 2019 21:16:00 +0800</pubDate><description><![CDATA[一般DP只有两个维度，但有时要用到第三个维度（这里维度不是指维护的变量数量，而是指空间，层级，每层的种类），二维的DP只有空间，层级 ，而每层的种类为1。当每层的种类不为1时，也就是三维DP，这时每层要进行多次DP。

三维DP例题：https://www.luogu.org/problem/P3961

题目描述

小A最近迷上了在上课时玩《黄金矿工》这款游戏。为了避免被老师发现,他必须小心翼翼...]]></description><category></category></item><item><title><![CDATA[数论模板]]></title><link>https://blog.youkuaiyun.com/Chter0/article/details/98175452</link><guid>https://blog.youkuaiyun.com/Chter0/article/details/98175452</guid><author>Chter0</author><pubDate>Wed, 16 Oct 2019 21:04:53 +0800</pubDate><description><![CDATA[扩展gcd

博客连接：https://blog.youkuaiyun.com/u012469987/article/details/39041797


ll exgcd(ll a, ll b, ll &amp;x, ll &amp;y)  
{
    if(b == 0)
    {
        x = 1;
        y = 0;
        return a;
    }
    ll...]]></description><category></category></item><item><title><![CDATA[Super Mario HDU - 4417  主席树模板（二）]]></title><link>https://blog.youkuaiyun.com/Chter0/article/details/102594633</link><guid>https://blog.youkuaiyun.com/Chter0/article/details/102594633</guid><author>Chter0</author><pubDate>Wed, 16 Oct 2019 20:57:06 +0800</pubDate><description><![CDATA[Mario is world-famous plumber. His “burly” figure and amazing jumping ability reminded in our memory. Now the poor princess is in trouble again and Mario needs to save his lover. We regard the road to...]]></description><category></category></item><item><title><![CDATA[Count on a tree   SPOJ - COT   主席树+LCA]]></title><link>https://blog.youkuaiyun.com/Chter0/article/details/102468010</link><guid>https://blog.youkuaiyun.com/Chter0/article/details/102468010</guid><author>Chter0</author><pubDate>Wed, 09 Oct 2019 19:12:43 +0800</pubDate><description><![CDATA[You are given a tree withNnodes. The tree nodes are numbered from1toN. Each node has an integer weight.

We will ask you to perform the following operation:

u v k: ask for the kth minimum weigh...]]></description><category></category></item><item><title><![CDATA[K-th Number POJ - 2104   主席树模板]]></title><link>https://blog.youkuaiyun.com/Chter0/article/details/101273858</link><guid>https://blog.youkuaiyun.com/Chter0/article/details/101273858</guid><author>Chter0</author><pubDate>Tue, 24 Sep 2019 11:37:46 +0800</pubDate><description><![CDATA[You are working for Macrohard company in data structures department. After failing your previous task about key insertion you were asked to write a new data structure that would be able to return quic...]]></description><category></category></item><item><title><![CDATA[欧拉函数的求法]]></title><link>https://blog.youkuaiyun.com/Chter0/article/details/98086041</link><guid>https://blog.youkuaiyun.com/Chter0/article/details/98086041</guid><author>Chter0</author><pubDate>Thu, 01 Aug 2019 18:31:49 +0800</pubDate><description><![CDATA[欧拉函数公式：



欧拉函数一般求法


long long eular(long long n)
{
    long long ans=n;
    for(int i=2;i*i&lt;=n;++i)
    {
        if(n%i==0)
        {
            ans-=ans/i;
            while(n%i==0)
         ...]]></description><category></category></item><item><title><![CDATA[二维线段树]]></title><link>https://blog.youkuaiyun.com/Chter0/article/details/90518674</link><guid>https://blog.youkuaiyun.com/Chter0/article/details/90518674</guid><author>Chter0</author><pubDate>Tue, 30 Jul 2019 16:57:31 +0800</pubDate><description><![CDATA[用于矩阵的快速修改和查询（修改和查询的时间复杂度都为logn，空间复杂度是（4*n）*（4*n））

这里提供两种操作 单点修改+区间询查 区间修改+单点询查

由于（单点修改+区间询查 ）和（区间修改+单点询查）的sum数组意义不同，所以该代码无法实现（单点修改+单点询查）和（区间修改+区间询查）

单点修改


void changex(int kx,int l,int r)
{
   ...]]></description><category></category></item><item><title><![CDATA[POJ - 1195   二维树状数组]]></title><link>https://blog.youkuaiyun.com/Chter0/article/details/90411839</link><guid>https://blog.youkuaiyun.com/Chter0/article/details/90411839</guid><author>Chter0</author><pubDate>Tue, 30 Jul 2019 16:57:03 +0800</pubDate><description><![CDATA[C - Mobile phones

POJ - 1195二维树状数组

Suppose that the fourth generation mobile phone base stations in the Tampere area operate as follows. The area is divided into squares. The squares form an S * ...]]></description><category></category></item></channel></rss>