<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/astpu84200</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; astpu84200]]></copyright><item><title><![CDATA[模拟退火  [JSOI2004]平衡点 / 吊打XXX]]></title><link>https://blog.youkuaiyun.com/astpu84200/article/details/101642141</link><guid>https://blog.youkuaiyun.com/astpu84200/article/details/101642141</guid><author>astpu84200</author><pubDate>Sun, 22 Sep 2019 19:44:00 +0800</pubDate><description><![CDATA[本人水平有限，题解不到为处，请多多谅解

本蒟蒻谢谢大家观看


题目：传送门

大致的模拟退火讲解我这里不再赘述，如有疑问请看这里
传送门连接

code:

#include &lt;bits/stdc++.h&gt;
#define down 0.996//徐徐降温 
using namespace std;
int n;
struc...]]></description><category></category></item><item><title><![CDATA[快读快写 O3 优化]]></title><link>https://blog.youkuaiyun.com/astpu84200/article/details/101642139</link><guid>https://blog.youkuaiyun.com/astpu84200/article/details/101642139</guid><author>astpu84200</author><pubDate>Sun, 22 Sep 2019 19:18:00 +0800</pubDate><description><![CDATA[模板：
code:

#include&lt;bits/stdc++.h&gt;
#pragma GCC optimize(3) //O3优化 

using namespace std;


inline int read(){//快读 
    int x=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(c...]]></description><category></category></item><item><title><![CDATA[卡特兰数（Catalan）公式、证明、代码、典例]]></title><link>https://blog.youkuaiyun.com/astpu84200/article/details/101642136</link><guid>https://blog.youkuaiyun.com/astpu84200/article/details/101642136</guid><author>astpu84200</author><pubDate>Sat, 21 Sep 2019 19:10:00 +0800</pubDate><description><![CDATA[大佬博客：传送门
组合数公式：
​
一、关于卡特兰数

   卡特兰数是一种经典的组合数，经常出现在各种计算中，其前几项为 : 1, 2, 5, 14, 42, 132, 429, 1430, 4862, 16796, 58786, 208012, 742900, 2674440, 9694845, 35357670, 129644790, 477638700, 1...]]></description><category></category></item><item><title><![CDATA[树状数组 ：单点修改，区间查询]]></title><link>https://blog.youkuaiyun.com/astpu84200/article/details/101642148</link><guid>https://blog.youkuaiyun.com/astpu84200/article/details/101642148</guid><author>astpu84200</author><pubDate>Sat, 21 Sep 2019 12:00:00 +0800</pubDate><description><![CDATA[本人水平有限，题解不到为处，请多多谅解

本蒟蒻谢谢大家观看

题目：

Problem E: 树状数组 1 ：单点修改，区间查询
Time Limit:10 SecMemory Limit:512 MBSubmit:231Solved:78[Submit][Status][Web Board]
Description
给定数列...]]></description><category></category></item><item><title><![CDATA[[模板]最近公共祖先LCA]]></title><link>https://blog.youkuaiyun.com/astpu84200/article/details/101642146</link><guid>https://blog.youkuaiyun.com/astpu84200/article/details/101642146</guid><author>astpu84200</author><pubDate>Sat, 21 Sep 2019 11:50:00 +0800</pubDate><description><![CDATA[本人水平有限，题解不到为处，请多多谅解

本蒟蒻谢谢大家观看


题目：传送门

倍增求LCA模板
code：

#include&lt;bits/stdc++.h&gt;
#pragma GCC optimize(3)
using namespace std;
int n,q,a,b,tot,m;
int nxt[1000010],head[1...]]></description><category></category></item><item><title><![CDATA[对测 (模拟)]]></title><link>https://blog.youkuaiyun.com/astpu84200/article/details/101642133</link><guid>https://blog.youkuaiyun.com/astpu84200/article/details/101642133</guid><author>astpu84200</author><pubDate>Sat, 21 Sep 2019 11:14:00 +0800</pubDate><description><![CDATA[本人水平有限，题解不到为处，请多多谅解
本蒟蒻谢谢大家观看

题目：
Problem A. Divisors(div.c/cpp/pas)
Input fifile: div.in
Output fifile: div.out
Time limit: 1 seconds
Memory limit: 128 megabytes
给定 m 个不同的正整数 a1, a2,...]]></description><category></category></item><item><title><![CDATA[对测   (离线DP+二分)]]></title><link>https://blog.youkuaiyun.com/astpu84200/article/details/101642131</link><guid>https://blog.youkuaiyun.com/astpu84200/article/details/101642131</guid><author>astpu84200</author><pubDate>Sat, 21 Sep 2019 10:43:00 +0800</pubDate><description><![CDATA[本人水平有限，题解不到为处，请多多谅解

本蒟蒻谢谢大家观看

题目：
Problem B. Market(market.c/cpp/pas)
Input fifile: market.in
Output fifile: market.out
Time limit: 1 seconds
Memory limit: 128 megabytes
在比特镇一共有...]]></description><category></category></item><item><title><![CDATA[模拟退火  （骗分算法）]]></title><link>https://blog.youkuaiyun.com/astpu84200/article/details/101642144</link><guid>https://blog.youkuaiyun.com/astpu84200/article/details/101642144</guid><author>astpu84200</author><pubDate>Thu, 19 Sep 2019 20:04:00 +0800</pubDate><description><![CDATA[大佬博客：一号传送门

　　　　　　

　　　　　　　　二号传送门



因为Δde&lt;0,所以Δde/T&lt;0,当其乘随机的极大值时，如果小于随机值，表示T越小，所以越稳定，最优解的概率加大，更新当前解至最优解


转载于:https://www.cnblogs.com/nlyzl/p/11552240.html...]]></description><category></category></item><item><title><![CDATA[基础数论入门]]></title><link>https://blog.youkuaiyun.com/astpu84200/article/details/101642132</link><guid>https://blog.youkuaiyun.com/astpu84200/article/details/101642132</guid><author>astpu84200</author><pubDate>Wed, 18 Sep 2019 10:29:00 +0800</pubDate><description><![CDATA[推荐大佬博客：传送门


QAQ 逃~

转载于:https://www.cnblogs.com/nlyzl/p/11540112.html]]></description><category></category></item><item><title><![CDATA[离散化]]></title><link>https://blog.youkuaiyun.com/astpu84200/article/details/101642086</link><guid>https://blog.youkuaiyun.com/astpu84200/article/details/101642086</guid><author>astpu84200</author><pubDate>Tue, 17 Sep 2019 20:06:00 +0800</pubDate><description><![CDATA[本人水平有限，题解不到为处，请多多谅解

本蒟蒻谢谢大家观看

题目：　　　　　　
　　　　　　　　　　　　Problem A: ycz的离散化
Description
给你n个数，每个数的大小在long long范围内。请输出n个数升序排序（小的在前，大的在后）后，第k个数的排名
Input
第一行两个数n,k，n&lt;=5e5,k&lt;=n第二行n个数...]]></description><category></category></item><item><title><![CDATA[RMQ（线段树） 模板 BZOJ 1699 [Usaco2007 Jan] Balanced Lineup排队]]></title><link>https://blog.youkuaiyun.com/astpu84200/article/details/101642122</link><guid>https://blog.youkuaiyun.com/astpu84200/article/details/101642122</guid><author>astpu84200</author><pubDate>Sat, 07 Sep 2019 15:20:00 +0800</pubDate><description><![CDATA[本人水平有限，题解不到为处，请多多谅解
本蒟蒻谢谢大家观看

题目：传送门

Problem E: 飞盘比赛
Time Limit:1 SecMemory Limit:128 MBSubmit:176Solved:126[Submit][Status][Web Board]
Description
每天, Cici 的N(1 &lt;= N &lt;=...]]></description><category></category></item><item><title><![CDATA[归并排序之逆序对]]></title><link>https://blog.youkuaiyun.com/astpu84200/article/details/101642120</link><guid>https://blog.youkuaiyun.com/astpu84200/article/details/101642120</guid><author>astpu84200</author><pubDate>Mon, 02 Sep 2019 14:59:00 +0800</pubDate><description><![CDATA[推荐大佬博客：https://www.cnblogs.com/adelalove/p/8484644.html
本人水平有限，题解不到为处，请多多谅解
本蒟蒻谢谢大家观看

题目：NOIP2013火柴排队


code:

#include&lt;bits/stdc++.h&gt;
#pragma GCC optimize(3)
#define mod 999...]]></description><category></category></item><item><title><![CDATA[64位整数乘法 快速幂]]></title><link>https://blog.youkuaiyun.com/astpu84200/article/details/101642130</link><guid>https://blog.youkuaiyun.com/astpu84200/article/details/101642130</guid><author>astpu84200</author><pubDate>Sun, 18 Aug 2019 09:33:00 +0800</pubDate><description><![CDATA[本人水平有限，题解不到为处，请多多谅解

本蒟蒻谢谢大家观看

题目：求a*b%p的结果，（1&lt;=a,b,p&lt;=10^18）
此题和上一题类似 只需要把乘改成加 （ans初始为0）
如：2*15 先求2*7+2*7+2*1（求2*15），再求 2*3+2*3+2*1（求2*7）最后求 2*2+2*1（求2*3）；
code：

#include&...]]></description><category></category></item><item><title><![CDATA[快速幂]]></title><link>https://blog.youkuaiyun.com/astpu84200/article/details/101642117</link><guid>https://blog.youkuaiyun.com/astpu84200/article/details/101642117</guid><author>astpu84200</author><pubDate>Sun, 18 Aug 2019 09:27:00 +0800</pubDate><description><![CDATA[本人水平有限，题解不到为处，请多多谅解

本蒟蒻谢谢大家观看

题目：求a^b%n (1&lt;=a,b,p&lt;=10^18)
此题用快速幂：采用分治算法将时间复杂度从O(n)降到O(logn)
例如：求2^15 我们先求2^7*2^7*2^1(求2^15) 再求 2^3*2^3*2^1(求2^7) 最后求 2^1*2^1*2^1(求2^3) 
让指数...]]></description><category></category></item><item><title><![CDATA[O(logn)]]></title><link>https://blog.youkuaiyun.com/astpu84200/article/details/101642114</link><guid>https://blog.youkuaiyun.com/astpu84200/article/details/101642114</guid><author>astpu84200</author><pubDate>Fri, 16 Aug 2019 08:55:00 +0800</pubDate><description><![CDATA[链接：https://blog.youkuaiyun.com/jdbc/article/details/42173751

转载于:https://www.cnblogs.com/nlyzl/p/11361733.html]]></description><category></category></item><item><title><![CDATA[二分查找 数组的二分查找]]></title><link>https://blog.youkuaiyun.com/astpu84200/article/details/101642127</link><guid>https://blog.youkuaiyun.com/astpu84200/article/details/101642127</guid><author>astpu84200</author><pubDate>Thu, 15 Aug 2019 11:58:00 +0800</pubDate><description><![CDATA[本人水平有限，题解不到为处，请多多谅解
本蒟蒻谢谢大家观看
1083: 数组的二分查找
Time Limit:1 SecMemory Limit:128 MBSubmit:1646Solved:641[Submit][Status][Web Board]
Description
在1500个整数中查整数x的位置，这些数已经从小到大排序了。若存在则输出其位置，...]]></description><category></category></item><item><title><![CDATA[二分答案 [TJOI2007]路标设置]]></title><link>https://blog.youkuaiyun.com/astpu84200/article/details/101642124</link><guid>https://blog.youkuaiyun.com/astpu84200/article/details/101642124</guid><author>astpu84200</author><pubDate>Thu, 15 Aug 2019 11:48:00 +0800</pubDate><description><![CDATA[本人水平有限，题解不到为处，请多多谅解

本蒟蒻谢谢大家观看

题目：https://www.luogu.org/problem/P3853

因为数据n&lt;=10000000;通过样例分析即可得出这是一到二分题。
样例解析:将一段区间分成（k+n）段，找出（k+n）的一段最大值。因为k不确定，所以如何分也不确定，我们就是要找出这段最大值在整个若干次情况中与...]]></description><category></category></item><item><title><![CDATA[队测 逆序对 permut]]></title><link>https://blog.youkuaiyun.com/astpu84200/article/details/101642121</link><guid>https://blog.youkuaiyun.com/astpu84200/article/details/101642121</guid><author>astpu84200</author><pubDate>Wed, 14 Aug 2019 15:58:00 +0800</pubDate><description><![CDATA[本人水平有限，题解不到为处，请多多谅解

本蒟蒻谢谢大家观看

题目：
　　　　　　　　　　　　permut
题目描述：
求由 1 到 n 一共 n 个数字组成的所有排列中，逆序对个数为 k 的有多少个
输入格式：
第一行为一个整数 T，为数据组数。
以下 T 行，每行两个整数 n，k，意义如题目所述。
输出格式：
对每组数据输出答案对 10000 取模...]]></description><category></category></item><item><title><![CDATA[线段树 模板之求和]]></title><link>https://blog.youkuaiyun.com/astpu84200/article/details/101642109</link><guid>https://blog.youkuaiyun.com/astpu84200/article/details/101642109</guid><author>astpu84200</author><pubDate>Tue, 13 Aug 2019 15:45:00 +0800</pubDate><description><![CDATA[本人水平有限，题解不到为处，请多多谅解

本蒟蒻谢谢大家观看
题目：

Problem A: 线段树之Sum
Time Limit:1 SecMemory Limit:128 MBSubmit:187Solved:130[Submit][Status][Web Board]
Description
给定一数列，规定有两种操作，一是修改某个元素，二是...]]></description><category></category></item><item><title><![CDATA[状压DP Sgu223 骑士]]></title><link>https://blog.youkuaiyun.com/astpu84200/article/details/101642118</link><guid>https://blog.youkuaiyun.com/astpu84200/article/details/101642118</guid><author>astpu84200</author><pubDate>Tue, 06 Aug 2019 16:05:00 +0800</pubDate><description><![CDATA[本人水平有限，题解不到为处，请多多谅解
本蒟蒻谢谢大家观看


题目：

Problem K: Sgu223 骑士
Time Limit:1 SecMemory Limit:128 MBSubmit:46Solved:25[Submit][Status][Web Board]
Description
在一个N*N的棋盘上放K个KING，KING...]]></description><category></category></item></channel></rss>