<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[DouglasConnor的博客]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/DouglasConnor</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; DouglasConnor]]></copyright><item><title><![CDATA[codeforces1249C1、C2 Good Numbers]]></title><link>https://blog.csdn.net/DouglasConnor/article/details/102704197</link><guid>https://blog.csdn.net/DouglasConnor/article/details/102704197</guid><author>DouglasConnor</author><pubDate>Wed, 23 Oct 2019 16:35:52 +0800</pubDate><description><![CDATA[问题链接
(https://codeforces.com/contest/1249/problem/C1)
(https://codeforces.com/contest/1249/problem/C2)
问题描述
定义“good number”为只由一群3i的数相加，且i不能相同的数。给一个n，找到不比n小的最小“good number”。
问题分析
昨晚太晚写了，导致很困一直想不到。
第二天想...]]></description><category></category></item><item><title><![CDATA[Comet OJ - Contest #11 B.usiness DP]]></title><link>https://blog.csdn.net/DouglasConnor/article/details/101319889</link><guid>https://blog.csdn.net/DouglasConnor/article/details/101319889</guid><author>DouglasConnor</author><pubDate>Wed, 25 Sep 2019 12:50:12 +0800</pubDate><description><![CDATA[问题连接
问题描述

问题分析
思路：dp[i][j]表示第i天且有j个结点第n天所能获得的最大结点数。根据题意dp[1][0]=0。然后从第2天起(因为第一天结点数为0，无操作)找到上一天的传递给这一天的解，从中获取最大值。后进行m种操作(完全背包)可以找到操作完后的各个状态的最优解。如此进行完n天后，因为第n天结束后每个状态还会有对应收入，所以再从第n天的所有状态中找到最大值即是答案。
其它心...]]></description><category></category></item><item><title><![CDATA[codeforces1215D Ticket Game]]></title><link>https://blog.csdn.net/DouglasConnor/article/details/100901744</link><guid>https://blog.csdn.net/DouglasConnor/article/details/100901744</guid><author>DouglasConnor</author><pubDate>Mon, 16 Sep 2019 22:12:59 +0800</pubDate><description><![CDATA[问题链接(https://codeforces.com/problemset/problem/1215/D)
问题描述
一张票有n位数，如果这张票的前一半数字的和等于后一半数字的和(n一定是偶数)，就称这张票为快乐票。有些数被擦除了，标记为’?’(’?‘的个数也是偶数)，现在Monocarp 和 Bicarp 进行一个游戏，两人轮流将’?'变换成0到9的任意一个数，Monocarp先手，如果最后票...]]></description><category></category></item><item><title><![CDATA[HDU1010Tempter of the Bone DFS、剪枝]]></title><link>https://blog.csdn.net/DouglasConnor/article/details/100058343</link><guid>https://blog.csdn.net/DouglasConnor/article/details/100058343</guid><author>DouglasConnor</author><pubDate>Sat, 24 Aug 2019 23:38:46 +0800</pubDate><description><![CDATA[Tempter of the Bone
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 166686    Accepted Submission(s): 44241
Problem Description
The doggie foun...]]></description><category></category></item><item><title><![CDATA[HDU6702^&^]]></title><link>https://blog.csdn.net/DouglasConnor/article/details/100050401</link><guid>https://blog.csdn.net/DouglasConnor/article/details/100050401</guid><author>DouglasConnor</author><pubDate>Sat, 24 Aug 2019 11:36:06 +0800</pubDate><description><![CDATA[^ &amp; ^
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 507    Accepted Submission(s): 239
Problem Description
Bit operation is a common comp...]]></description><category></category></item><item><title><![CDATA[牛客 SHUFFLE洗牌 找规律 逆元]]></title><link>https://blog.csdn.net/DouglasConnor/article/details/98475145</link><guid>https://blog.csdn.net/DouglasConnor/article/details/98475145</guid><author>DouglasConnor</author><pubDate>Sun, 04 Aug 2019 22:28:00 +0800</pubDate><description><![CDATA[链接：https://ac.nowcoder.com/acm/problem/19872?&amp;headNav=acm
来源：牛客网
时间限制：C/C++ 3秒，其他语言6秒
空间限制：C/C++ 262144K，其他语言524288K
64bit IO Format: %lld
题目描述
为了表彰小联为Samuel星球的探险所做出的贡献，小联被邀请参加Samuel星球近距离载人探险活动。 由...]]></description><category></category></item><item><title><![CDATA[HDU3579 Hello Kiki 中国剩余定理]]></title><link>https://blog.csdn.net/DouglasConnor/article/details/98474901</link><guid>https://blog.csdn.net/DouglasConnor/article/details/98474901</guid><author>DouglasConnor</author><pubDate>Sun, 04 Aug 2019 21:52:38 +0800</pubDate><description><![CDATA[Hello Kiki
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6297    Accepted Submission(s): 2404
Problem Description
One day I was shopping in t...]]></description><category></category></item><item><title><![CDATA[POJ2387 Til the Cows Come Home 最短路]]></title><link>https://blog.csdn.net/DouglasConnor/article/details/98395554</link><guid>https://blog.csdn.net/DouglasConnor/article/details/98395554</guid><author>DouglasConnor</author><pubDate>Sat, 03 Aug 2019 23:55:36 +0800</pubDate><description><![CDATA[Til the Cows Come Home
Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 91593		Accepted: 29824
Description
Bessie is out in the field and wants to get back to the barn to get as much sleep ...]]></description><category></category></item><item><title><![CDATA[POJ1061 青蛙的约会 扩展欧几里得]]></title><link>https://blog.csdn.net/DouglasConnor/article/details/98393891</link><guid>https://blog.csdn.net/DouglasConnor/article/details/98393891</guid><author>DouglasConnor</author><pubDate>Sat, 03 Aug 2019 23:44:13 +0800</pubDate><description><![CDATA[青蛙的约会
Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 138207		Accepted: 31164
Description
两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约定各自朝西跳，直到碰面为止。可是它们出发之前忘记了一件很重要的事情，既没有问清楚对方...]]></description><category></category></item><item><title><![CDATA[HDU1078 FatMouse and Cheese 记忆化搜索]]></title><link>https://blog.csdn.net/DouglasConnor/article/details/90411044</link><guid>https://blog.csdn.net/DouglasConnor/article/details/90411044</guid><author>DouglasConnor</author><pubDate>Sat, 03 Aug 2019 10:46:40 +0800</pubDate><description><![CDATA[FatMouse and Cheese
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 16459    Accepted Submission(s): 7010
Problem Description
FatMouse has stor...]]></description><category></category></item><item><title><![CDATA[codeforce1196D1、D2 RGB Substring]]></title><link>https://blog.csdn.net/DouglasConnor/article/details/98252438</link><guid>https://blog.csdn.net/DouglasConnor/article/details/98252438</guid><author>DouglasConnor</author><pubDate>Fri, 02 Aug 2019 23:48:05 +0800</pubDate><description><![CDATA[问题链接(https://codeforces.com/problemset/problem/1196/D1)
问题链接(https://codeforces.com/problemset/problem/1196/D2)
问题描述
有长为n的字符串，要求通过修改一些字符得到一个长度为k的子串，使得这个子串是"RGBRGB…"的子串。输出修改的字符的最小个数。D1与D2的区别是n,k的大小不一样。...]]></description><category></category></item><item><title><![CDATA[POJ3090 Visible Lattice Points 欧拉函数]]></title><link>https://blog.csdn.net/DouglasConnor/article/details/98249193</link><guid>https://blog.csdn.net/DouglasConnor/article/details/98249193</guid><author>DouglasConnor</author><pubDate>Fri, 02 Aug 2019 22:55:45 +0800</pubDate><description><![CDATA[Visible Lattice Points
Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 9734		Accepted: 5920
Description
A lattice point (x, y) in the first quadrant (x and y are integers greater than or e...]]></description><category></category></item><item><title><![CDATA[牛客 栈与排列 模拟]]></title><link>https://blog.csdn.net/DouglasConnor/article/details/98245162</link><guid>https://blog.csdn.net/DouglasConnor/article/details/98245162</guid><author>DouglasConnor</author><pubDate>Fri, 02 Aug 2019 22:07:25 +0800</pubDate><description><![CDATA[链接：https://ac.nowcoder.com/acm/problem/14893
来源：牛客网
时间限制：C/C++ 1秒，其他语言2秒
空间限制：C/C++ 131072K，其他语言262144K
64bit IO Format: %lld
题目描述
给你一个1-&gt;n的排列和一个栈，入栈顺序给定
你要在不打乱入栈顺序的情况下，对数组进行从大到小排序
当无法完全排序时，请输出字典序最...]]></description><category></category></item><item><title><![CDATA[POJ2752 Seek the Name, Seek the Fame]]></title><link>https://blog.csdn.net/DouglasConnor/article/details/98242236</link><guid>https://blog.csdn.net/DouglasConnor/article/details/98242236</guid><author>DouglasConnor</author><pubDate>Fri, 02 Aug 2019 21:51:01 +0800</pubDate><description><![CDATA[Seek the Name, Seek the Fame
Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 27506		Accepted: 14240
Description
The little cat is so famous, that many couples tramp over hill and dale to B...]]></description><category></category></item><item><title><![CDATA[codeforce1194D 1-2-K Game 博弈]]></title><link>https://blog.csdn.net/DouglasConnor/article/details/98117107</link><guid>https://blog.csdn.net/DouglasConnor/article/details/98117107</guid><author>DouglasConnor</author><pubDate>Fri, 02 Aug 2019 00:20:49 +0800</pubDate><description><![CDATA[问题链接(https://codeforces.com/problemset/problem/1194/D)
问题描述
先是划分出n+1个方格，编号从左到右是0到n。游戏从编号n开始，规定两人每次只能从右往左移动chip(碎片？)1、2或者k步。谁先不能移动(在0处不能移动)，谁输，Alice先手。
进行T场游戏，每一场给出了n,k,输出每一场的胜利者的名字。
问题分析
下用x指代下标。
1、先看...]]></description><category></category></item><item><title><![CDATA[codeforce1064B Equations of Mathematical Magic]]></title><link>https://blog.csdn.net/DouglasConnor/article/details/98116242</link><guid>https://blog.csdn.net/DouglasConnor/article/details/98116242</guid><author>DouglasConnor</author><pubDate>Thu, 01 Aug 2019 23:07:00 +0800</pubDate><description><![CDATA[问题链接(https://codeforces.com/problemset/problem/1064/B)
问题描述
有t个问题，每个问题都有一个a,问满足a−(a⊕x)−x=0的x有多少个。其中⊕为异或运算。
问题分析
第一反应是打表，另外写代码输出从1到a中有哪些数是满足这个式子的，并计数。观察后发现满足式子的x的个数恰好是2的a的二进制数的1的个数次方，count=2n,n为二进制数a的1...]]></description><category></category></item><item><title><![CDATA[HDU1880魔咒词典 字符串哈希]]></title><link>https://blog.csdn.net/DouglasConnor/article/details/98116091</link><guid>https://blog.csdn.net/DouglasConnor/article/details/98116091</guid><author>DouglasConnor</author><pubDate>Thu, 01 Aug 2019 22:56:51 +0800</pubDate><description><![CDATA[魔咒词典
Time Limit: 8000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 18839    Accepted Submission(s): 4398
Problem Description
哈利波特在魔法学校的必修课之一就是学习魔咒。据说魔法世界有100...]]></description><category></category></item><item><title><![CDATA[codeforce1199A City Day]]></title><link>https://blog.csdn.net/DouglasConnor/article/details/97975907</link><guid>https://blog.csdn.net/DouglasConnor/article/details/97975907</guid><author>DouglasConnor</author><pubDate>Wed, 31 Jul 2019 23:15:37 +0800</pubDate><description><![CDATA[问题链接(https://codeforces.com/problemset/problem/1199/A)
问题描述
给n,x,y，以及这n天的下雨量ai。要找一天(下标为)d，要求这一天的下雨量是这一天前x天到后y天的下雨量中最小的。输出最早的(下标最小的)d。保证答案一定存在。
问题分析
因为x,y的最大可能值为7，很小，所以直接遍历去找即可。注意处理好边界问题。
代码如下
#include...]]></description><category></category></item><item><title><![CDATA[codeforce1198A MP3]]></title><link>https://blog.csdn.net/DouglasConnor/article/details/97967451</link><guid>https://blog.csdn.net/DouglasConnor/article/details/97967451</guid><author>DouglasConnor</author><pubDate>Wed, 31 Jul 2019 23:05:38 +0800</pubDate><description><![CDATA[问题链接(https://codeforces.com/problemset/problem/1198/A)
问题描述
给了n个数值，如果这n个数种类为K，那么要k=[log2K]（向下取整）去存每个数值，也就是总共要nk的大小去存这n个数值。现在有I byte的存储空间，转化为相同单位是8I bit。如果存放不了这些数值，可以采取一种特别的方式解决，选取两个整数l,r。如果数值比l小的，都被转化...]]></description><category></category></item><item><title><![CDATA[POJ3903 Stock Exchange 最长上升子序列]]></title><link>https://blog.csdn.net/DouglasConnor/article/details/97964991</link><guid>https://blog.csdn.net/DouglasConnor/article/details/97964991</guid><author>DouglasConnor</author><pubDate>Wed, 31 Jul 2019 21:49:25 +0800</pubDate><description><![CDATA[Stock Exchange
Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 9901		Accepted: 3430
Description
The world financial crisis is quite a subject. Some people are more relaxed while others are...]]></description><category></category></item></channel></rss>