<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[baochuo7869的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/baochuo7869</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; baochuo7869]]></copyright><item><title><![CDATA[莫队算法----区间求和]]></title><link>https://blog.youkuaiyun.com/baochuo7869/article/details/101065667</link><guid>https://blog.youkuaiyun.com/baochuo7869/article/details/101065667</guid><author>baochuo7869</author><pubDate>Tue, 17 Sep 2019 14:36:00 +0800</pubDate><description><![CDATA[连接 https://ac.nowcoder.com/acm/contest/1085/G

链接：https://ac.nowcoder.com/acm/contest/1085/G来源：牛客网
题目描述




小sun最近突然对区间来了兴趣，现在他有这样一个问题想问问你： 给你n个数，每个数为aia_iai​，现在有m个询问，每个询问l,r，需要求出： ∑i=...]]></description><category></category></item><item><title><![CDATA[二分答案   例题]]></title><link>https://blog.youkuaiyun.com/baochuo7869/article/details/101065673</link><guid>https://blog.youkuaiyun.com/baochuo7869/article/details/101065673</guid><author>baochuo7869</author><pubDate>Fri, 13 Sep 2019 21:03:00 +0800</pubDate><description><![CDATA[http://www.51nod.com/Challenge/TopicProblemList.html#topicId=291
二分答案思路就是先确定好答案的范围，一般越大越好，去个left为答案的最小取值，right为答案的最大取值
然后二分，，同时判断当前状态时候满足答案，如果满足的话，还要考虑是否为最优的选择。
如题目：
工厂里面，有n根待加工的铁棒，长度以米为单位，精确...]]></description><category></category></item><item><title><![CDATA[Treasure Island DFS +存图]]></title><link>https://blog.youkuaiyun.com/baochuo7869/article/details/101065695</link><guid>https://blog.youkuaiyun.com/baochuo7869/article/details/101065695</guid><author>baochuo7869</author><pubDate>Wed, 11 Sep 2019 23:33:00 +0800</pubDate><description><![CDATA[All of us love treasures, right? That's why young Vasya is heading for a Treasure Island.
Treasure Island may be represented as a rectangular tablen×mn×mwhich is surrounded by the ocean. Let...]]></description><category></category></item><item><title><![CDATA[二分例题  51nod]]></title><link>https://blog.youkuaiyun.com/baochuo7869/article/details/101065692</link><guid>https://blog.youkuaiyun.com/baochuo7869/article/details/101065692</guid><author>baochuo7869</author><pubDate>Wed, 11 Sep 2019 17:52:00 +0800</pubDate><description><![CDATA[例题1
1010 只包含因子2 3 5的数
http://www.51nod.com/Challenge/Problem.html#problemId=1010




K的因子中只包含2 3 5。满足条件的前10个数是：2,3,4,5,6,8,9,10,12,15。
所有这样的K组成了一个序列S，现在给出一个数n，求S中 &gt;= 给定数的最小的数。
例如：n ...]]></description><category></category></item><item><title><![CDATA[niuke---勾股定理]]></title><link>https://blog.youkuaiyun.com/baochuo7869/article/details/101065661</link><guid>https://blog.youkuaiyun.com/baochuo7869/article/details/101065661</guid><author>baochuo7869</author><pubDate>Sat, 07 Sep 2019 09:54:00 +0800</pubDate><description><![CDATA[勾股定理------：
当其中一个数a大于1并且为奇数时即a=2*n+1， 那么另外两个数分别为 b=2*n*n+2*n; c=b+1;
当a为大于等于4的偶数时，即a=2*n时，那么另外两个数分别为 b=n*n-1 c=n*n+1;

#include&lt;bits/stdc++.h&gt;
using namespace std;
typedef long l...]]></description><category></category></item><item><title><![CDATA[niuke --abc]]></title><link>https://blog.youkuaiyun.com/baochuo7869/article/details/101065689</link><guid>https://blog.youkuaiyun.com/baochuo7869/article/details/101065689</guid><author>baochuo7869</author><pubDate>Fri, 06 Sep 2019 23:05:00 +0800</pubDate><description><![CDATA[链接：https://ac.nowcoder.com/acm/contest/1083/A来源：牛客网
给出一个字符串s,你需要做的是统计s中子串”abc”的个数。子串的定义就是存在任意下标a&lt;b&lt;c，那么”s[a]s[b]s[c]”就构成s的一个子串。如”abc”的子串有”a”、”b”、”c”、”ab”、”ac”、”bc”、”abc”。
输入描述:
一个字符串s。保证...]]></description><category></category></item><item><title><![CDATA[codeforces Equalizing by Division (easy version)]]></title><link>https://blog.youkuaiyun.com/baochuo7869/article/details/101065657</link><guid>https://blog.youkuaiyun.com/baochuo7869/article/details/101065657</guid><author>baochuo7869</author><pubDate>Wed, 04 Sep 2019 11:40:00 +0800</pubDate><description><![CDATA[output
standard output


The only difference between easy and hard versions is the number of elements in the array.
You are given an arrayaaconsisting ofnnintegers. In one move you c...]]></description><category></category></item><item><title><![CDATA[投硬币]]></title><link>https://blog.youkuaiyun.com/baochuo7869/article/details/101065420</link><guid>https://blog.youkuaiyun.com/baochuo7869/article/details/101065420</guid><author>baochuo7869</author><pubDate>Mon, 02 Sep 2019 16:28:00 +0800</pubDate><description><![CDATA[https://ac.nowcoder.com/acm/contest/879/B
链接：https://ac.nowcoder.com/acm/contest/879/B来源：牛客网
你在练习 dp，你每一次会有 p 的概率成功，1-p 的概率失败 求投 n 次后，至少有 k 次成功的概率
  答案模 998244353，其中 0≤k,n≤105,0≤p&lt;998244353...]]></description><category></category></item><item><title><![CDATA[归并法求逆序对]]></title><link>https://blog.youkuaiyun.com/baochuo7869/article/details/101065427</link><guid>https://blog.youkuaiyun.com/baochuo7869/article/details/101065427</guid><author>baochuo7869</author><pubDate>Sun, 25 Aug 2019 11:10:00 +0800</pubDate><description><![CDATA[l例题连接：https://www.luogu.org/problem/P1908

猫猫TOM和小老鼠JERRY最近又较量上了，但是毕竟都是成年人，他们已经不喜欢再玩那种你追我赶的游戏，现在他们喜欢玩统计。最近，TOM老猫查阅到一个人类称之为“逆序对”的东西，这东西是这样定义的：对于给定的一段正整数序列，逆序对就是序列中ai&gt;aj且i&lt;j的有序对。知道这概念后，他们就比...]]></description><category></category></item><item><title><![CDATA[欧拉的三角形问题]]></title><link>https://blog.youkuaiyun.com/baochuo7869/article/details/101065687</link><guid>https://blog.youkuaiyun.com/baochuo7869/article/details/101065687</guid><author>baochuo7869</author><pubDate>Sun, 25 Aug 2019 09:04:00 +0800</pubDate><description><![CDATA[https://www.cnblogs.com/vectors07/p/8053427.html
即 一个n边形（n&gt;=3） 沿着顶点切割，分割成三角形，最多有多少种方案





转载于:https://www.cnblogs.com/Accepting/p/11406918.html...]]></description><category></category></item><item><title><![CDATA[NK16]]></title><link>https://blog.youkuaiyun.com/baochuo7869/article/details/101065653</link><guid>https://blog.youkuaiyun.com/baochuo7869/article/details/101065653</guid><author>baochuo7869</author><pubDate>Sat, 24 Aug 2019 10:27:00 +0800</pubDate><description><![CDATA[C 小石的海岛之旅
链接：https://ac.nowcoder.com/acm/contest/949/C来源：牛客网


暑假到了，小石和小雨到海岛上玩。 从水平方向看海岛可以看成 nnn个小块，每一个小块都有一个高度hih_ihi​， 水位一开始为 000，随着水位的上升，海岛分成了若干块。 现在有 mmm 个询问，求当水位为aia_iai​ 时，海岛会分成多少块。 ...]]></description><category></category></item><item><title><![CDATA[组合数的计算]]></title><link>https://blog.youkuaiyun.com/baochuo7869/article/details/101065663</link><guid>https://blog.youkuaiyun.com/baochuo7869/article/details/101065663</guid><author>baochuo7869</author><pubDate>Fri, 23 Aug 2019 13:03:00 +0800</pubDate><description><![CDATA[#include&lt;bits/stdc++.h&gt;
using namespace std;
const int N=1e3+7;
int dp[N][N];
void cinin()
{
    for(int i=0;i&lt;=N;i++){
        dp[i][i]=dp[i][0]=1;
    }
    for(int i=1;i&lt...]]></description><category></category></item><item><title><![CDATA[HPU第一次团队赛]]></title><link>https://blog.youkuaiyun.com/baochuo7869/article/details/101065650</link><guid>https://blog.youkuaiyun.com/baochuo7869/article/details/101065650</guid><author>baochuo7869</author><pubDate>Thu, 22 Aug 2019 20:47:00 +0800</pubDate><description><![CDATA[D. Tom的战力问题

Tom被斯派克揍了TAT。Tom下定决心要战胜斯派克。但是在战胜最强的斯派克之前，Tom要先打败其他的狗。为此，他打算先收集一下信息。现在Tom在了得到了一些关于战斗力的小道消息，例如X号狗狗的战力比Y号狗狗的战力高S点。Tom想知道利用这些消息，能不能判断出某两只狗之间的战力高低？高多少？


输入格式
第一行包含三个整数N,M和Q。N表示狗总数，...]]></description><category></category></item><item><title><![CDATA[最大流模板]]></title><link>https://blog.youkuaiyun.com/baochuo7869/article/details/101065684</link><guid>https://blog.youkuaiyun.com/baochuo7869/article/details/101065684</guid><author>baochuo7869</author><pubDate>Mon, 19 Aug 2019 16:41:00 +0800</pubDate><description><![CDATA[模板一：
Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regro...]]></description><category></category></item><item><title><![CDATA[大数相加]]></title><link>https://blog.youkuaiyun.com/baochuo7869/article/details/101065683</link><guid>https://blog.youkuaiyun.com/baochuo7869/article/details/101065683</guid><author>baochuo7869</author><pubDate>Mon, 19 Aug 2019 15:46:00 +0800</pubDate><description><![CDATA[I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.
InputThe first line of the input contains an integer T(1&lt;=T&lt;=20) which means t...]]></description><category></category></item><item><title><![CDATA[. Number throry]]></title><link>https://blog.youkuaiyun.com/baochuo7869/article/details/101065647</link><guid>https://blog.youkuaiyun.com/baochuo7869/article/details/101065647</guid><author>baochuo7869</author><pubDate>Sun, 18 Aug 2019 23:11:00 +0800</pubDate><description><![CDATA[steve学完了快速幂，现在会他快速的计算：(ij)%d,Alex作为一个数学大师，给了steve一个问题：已知i∈[1,n],j∈[1,m]，计算满足(ij)%d=0的(i,j)的对数。


输入格式
T组输入，对于每一组输入三个数n,m,d。(1≤T≤1000,1≤n,m,d≤109)。
输出格式
对于每组输入，输出答案，每个答案占一行。

...]]></description><category></category></item><item><title><![CDATA[掷骰子 dp]]></title><link>https://blog.youkuaiyun.com/baochuo7869/article/details/101065644</link><guid>https://blog.youkuaiyun.com/baochuo7869/article/details/101065644</guid><author>baochuo7869</author><pubDate>Sun, 18 Aug 2019 22:58:00 +0800</pubDate><description><![CDATA[B. 掷骰子


单点时限:2.0 sec
内存限制:512 MB




骰子，中国传统民间娱乐用来投掷的博具，早在战国时期就已经被发明。
现在给你n个骰子，求n个骰子掷出点数之和为a的概率是多少。

输入格式
第一行输入一个整数T，表示有T组测试数据（1≤T≤10）每组测试数据输入两个整数n,a，表示共有n个骰子，骰子点数总和为a(1...]]></description><category></category></item><item><title><![CDATA[CodeForces - 876B H - 差异的可分割性]]></title><link>https://blog.youkuaiyun.com/baochuo7869/article/details/101065641</link><guid>https://blog.youkuaiyun.com/baochuo7869/article/details/101065641</guid><author>baochuo7869</author><pubDate>Sun, 18 Aug 2019 18:49:00 +0800</pubDate><description><![CDATA[现在有n个整数，在这n个数中找出k个数，保证这k个数中任意两个数差的绝对值可以被m整除。

Input第一行输入三个整数n，k，m(2&lt;=k&lt;=n&lt;=100000,1&lt;=m&lt;=100000)。第二行包含n个整数a1，a2，...，  an（0 &lt;= ai &lt;= 10^9 )。Output如果不存在这样的k个数，输出"No"；否则输出"Yes...]]></description><category></category></item><item><title><![CDATA[CodeForces - 855B ring 前缀和]]></title><link>https://blog.youkuaiyun.com/baochuo7869/article/details/101065681</link><guid>https://blog.youkuaiyun.com/baochuo7869/article/details/101065681</guid><author>baochuo7869</author><pubDate>Sun, 18 Aug 2019 18:44:00 +0800</pubDate><description><![CDATA[邓布利多教授正在帮助哈利摧毁魂器。当他怀疑一个魂器出现在那里时，他去了冈特沙克。他看到Marvolo Gaunt的戒指，并将其确定为魂器。虽然他摧毁了它，但仍然受到诅咒的影响。斯内普教授正在帮助邓布利多解除诅咒。为此，他想给Dumbledore提供他制作的药水x滴。
x的值被计算为给定p，q，r和阵列a1，a2，......的p·ai + q·aj + r·ak的最大值，使得1≤i≤j...]]></description><category></category></item><item><title><![CDATA[CodeForces - 913C  （贪心）]]></title><link>https://blog.youkuaiyun.com/baochuo7869/article/details/101065677</link><guid>https://blog.youkuaiyun.com/baochuo7869/article/details/101065677</guid><author>baochuo7869</author><pubDate>Sun, 18 Aug 2019 18:05:00 +0800</pubDate><description><![CDATA[点完菜，他们发现好像觉得少了点什么？
想想马上就要回老家了某不愿透露姓名的林姓学长再次却陷入了沉思。。。。。。。。。
他默默的去前台打算点几瓶二锅头。
他发现菜单上有n种不同毫升的酒. 第i种有2i - 1毫升价格为ci元.商店中每种类型的酒的数量可以被认为是无限的。.
他对于自己能喝多少还是有点B-Tree的，但是他认为喝酒一定要喝的尽兴，于是他打算买至少L 毫升，但...]]></description><category></category></item></channel></rss>