自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+
  • 博客(186)
  • 收藏
  • 关注

原创 51nod 0和1相等串

题目链接:https://www.51nod.com/onlineJudge/submitDetail.html#!judgeId=424616题解:很好的一道思维题,自己一开始的想法就是dp,但是范围比较大,也没什么好的想法。后来又想用二分,但没什么用(范围还是太大),最后看到了大佬的思路,因为数的种类比较少,直接进行+和-的操作就能纪录所有的状态,学到了。代码:#include <cmath>

2017-12-11 20:18:13 370

原创 51nod 1051 最大子矩阵和

题目链接: https://www.51nod.com/onlineJudge/submitDetail.html#!judgeId=407086 题解: 最大字段和的变形 代码:#include <cmath>#include <cstdio>#include <string>#include <cstring>#include <vector>#include <iostrea

2017-11-22 21:19:47 323

原创 hdu A Simple Stone Game

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6237题解:stm看的时候没看到每次只能取一个,蛇皮了半天。唉。。。。。。 直接暴力枚举质因子就行了。代码:#include <map>#include <cmath>#include <vector>#include <cstdio>#include <cstring>#include <i

2017-11-11 20:51:11 641

原创 51nod 1006 最长公共子序列Lcs

题目链接:http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1006题解:重新刷一下51,发现自己连这基础题都打了半天,唉,不行了。代码:#include <set>#include <map>#include <cmath>#include <string>#include <vector>#include <cs

2017-11-11 09:48:01 234

原创 codeforces 887B

题目链接:http://codeforces.com/contest/887/problem/B题解:100%纯暴力代码:#include <map>#include <cmath>#include <cstdio>#include <vector>#include <cstring>#include <iostream>#include <algorithm>using namesp

2017-11-09 21:48:30 287

原创 bzoj 1012

题目链接:http://www.lydsy.com/JudgeOnline/problem.php?id=1012题解:很久没怎么写线段树了,一个小错误错了半天。唉!代码:#include <cmath>#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;

2017-11-09 19:18:46 193

原创 code forces E. Danil and a Part-time Job

题目链接:http://codeforces.com/contest/877/problem/E题解:dfs序+线段树区间更新和区间求和代码:#include <cmath>#include <cstdio>#include <vector>#include <cstring>#include <iostream>#include <algorithm>using namespace s

2017-11-08 20:56:20 194

原创 codeforces 877D

题目链接:http://codeforces.com/contest/877/problem/D题解:有段时间没怎么好好打代码了,简单的BFS打错了一个地方,找了半天。代码:#include <map>#include <cmath>#include <queue>#include <vector>#include <cstdio>#include <cstring>#include <

2017-11-07 20:51:51 305

原创 codeforces 877C

题目链接:http://codeforces.com/contest/877/problem/C题解:规律题。代码:#include <map>#include <cmath>#include <string>#include <vector>#include <cstdio>#include <cstring>#include <iostream>#include <algorith

2017-11-07 19:40:04 311

原创 codeforces 877B

题目链接:http://codeforces.com/contest/877/problem/B题解:暴力区间更新代码:#include <map>#include <cmath>#include <string>#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespa

2017-11-07 19:05:47 912

原创 Gym - 100851F Froggy Ford

题目链接:http://codeforces.com/gym/100851/attachments题解:二分枚举长度,BFS暴力找路径,注意边界的处理代码:#include <set>#include <map>#include <cmath>#include <queue>#include <cstdio>#include <vector>#include <string>#incl

2017-11-02 22:19:55 289

原创 codeforces 873B

题目链接:http://codeforces.com/problemset/problem/873/B题解:前缀和+离散化,dp的暴力更新。代码:#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;#define met(a,b) memset(a,b,s

2017-10-30 20:29:46 348

原创 2015 ACM National Contest Romania - Round 1 B

题目链接:http://codeforces.com/gym/100923/problem/B题解:Dijkstra+优化,用Spfa会炸代码:#include<map>#include<cstdio>#include<cstring>#include<queue>#include<vector>#include<iostream>#include<algorithm>using na

2017-10-21 20:32:16 320

原创 Gym - 101473J

题目链接:http://codeforces.com/gym/101473/attachments题解:最大生成树+树链剖分+线段树维护最小值代码:#include <map>#include <cmath>#include <cstdio>#include <vector>#include <cstring>#include <iostream>#include <algorithm>

2017-10-21 10:42:21 423

原创 Bzoj 1036: [ZJOI2008]树的统计Count

题目链接:http://www.lydsy.com/JudgeOnline/problem.php?id=1036题解:树链剖分+线段树操作代码:#include <cmath>#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;#define met(

2017-10-19 21:24:14 203

原创 hdu 6006 Engineer Assignment

题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=6006题解:状态压缩+类背包dp代码:#include <cmath>#include <vector>#include <queue>#include <cstdio>#include <cstring>#include <iostream>#include <algorithm

2017-10-12 20:34:24 225

原创 51nod 1127 最短的包含字符串

题目链接:http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1127题解:尺取。自己用的deque(尺取和滑动窗口都能用)代码:#include <map>#include <cmath>#include <vector>#include <queue>#include <cstdio>#include <cstri

2017-10-08 22:11:19 225

原创 51nod 1596 搬货物

题目链接:http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1596题解:论外挂的重要性,强行卡过去。代码:#include <map>#include <cmath>#include <vector>#include <queue>#include <cstdio>#include <cstring>#inclu

2017-10-08 21:03:21 176

原创 hdu 3689 Infinite monkey theorem

题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=3689题解:kmp+概率dp代码:#include <cmath>#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;#define met(a,

2017-10-08 10:39:20 254

原创 codeforces 869A The Artful Expedient

题目链接:http://codeforces.com/problemset/problem/869/A题解:直接map,炸了时间。以后还是老老实实写个find的函数。 心碎。代码:#include <map>#include <cmath>#include <vector>#include <cstdio>#include <cstring>#include <iostream>#in

2017-10-07 20:24:17 251

原创 codeforces 367B

题目链接:http://codeforces.com/contest/367/problem/B题解:双端队列直接维护(原来map可以直接相等,这里学到了。。。)代码:#include <map>#include <cmath>#include <deque>#include <vector>#include <cstdio>#include <cstring>#include <vec

2017-10-06 10:17:24 197

原创 PKU 2195 Going Home

题目链接:http://poj.org/problem?id=2195题解:最小费用流代码:#include <cmath>#include <queue>#include <vector>#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;#def

2017-10-05 22:01:10 280

原创 codeforces 868C - Qualification Rounds

题目链接:http://codeforces.com/problemset/problem/868/C题解:离散化后,只要确定有一对满足条件就行了,但是需要注意只有一个的特殊情况。代码:#include <map>#include <cmath>#include <queue>#include <vector>#include <cstdio>#include <cstring>#inc

2017-10-05 21:12:03 461

原创 Gym - 101485E Elementary Math

题目链接:https://odzkskevi.qnssl.com/19afdbfcc9ee8720dd81032e85ed2a5a?v=1506446502题解:二分匹配或网络流。代码:Dinic模板:#include <cmath>#include <queue>#include <cstdio>#include <cstring>#include <iostream>#include

2017-10-03 09:39:12 299

原创 PKU 3281 Dining

题目链接:http://poj.org/problem?id=3281题解:Dinic 关键是怎么建图。但是自己比较蛇皮的只建了一只牛的图,到现在还没怎么明白为什么要建两只牛。代码:#include <cmath>#include <map>#include <vector>#include <queue>#include <cstdio>#include <cstring>#inclu

2017-09-29 22:06:24 157

原创 poj 1273 Drainage Ditches

题目链接:http://poj.org/problem?id=1273题解:最大流EK模板代码:#include <cmath>#include <vector>#include <queue>#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;#d

2017-09-28 20:59:34 164

原创 codeforces 864E Fire

题目链接:http://codeforces.com/contest/864/problem/E题解:简单的01背包,加一个DFS。代码:#include <cmath>#include <vector>#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std

2017-09-28 19:24:09 261

原创 codeforces 863B

题目链接:http://codeforces.com/problemset/problem/863/B题解:没看到这数据范围。。。。。。 蛇皮!!!代码:#include <cmath>#include <queue>#include <cstdio>#include <vector>#include <cstring>#include <iostream>#include <algor

2017-09-26 21:59:37 539

原创 codeforces 862B. Mahmoud and Ehab and the bipartiteness

题目链接:http://codeforces.com/contest/862/problem/B题解:二分图,染色法。代码:#include <map>#include <cmath>#include <vector>#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using names

2017-09-21 20:18:28 252

原创 2017 ACM/ICPC Asia Regional Qingdao Online 1003 The Dominator of Strings

题目链接:http://acm.hdu.edu.cn/contests/contest_showproblem.php?pid=1003&cid=778题解:STM,队友讲题意的时候漏掉了范围。。。。。。 强行AC自动机。代码:#include<cstdio>#include<cstring>#define M 100000+10using namespace std;struct AC{

2017-09-17 19:08:04 408

原创 线段树例题集合

1.hdu 1556 代码:#include <cmath>#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;#define inf 0x3f3f3f3f #define met(a,b) memset(a,b,sizeof(a))const i

2017-09-11 21:44:21 281

原创 2008-2009 ACM-ICPC, NEERC, Moscow Subregional Contest B Bankrupt Broker

题目连接:http://codeforces.com/gym/100861/attachments题解:比较水的题目,基本看的懂题意就能打。 这里需要一下离散化。代码:#include <cmath>#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;

2017-09-08 10:06:07 394

原创 HDU 2896 病毒侵袭

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2896题解:AC自动机裸题。值得注意的是:这里会很容易爆内存,并且结果是从小到大输出。代码:#include <cmath>#include <cstdio>#include <queue>#include <vector>#include <cstring>#include <iostream

2017-09-06 20:59:58 190

原创 HDU 2222

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2222题解:AC自动机模板题代码:#include <cmath>#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;#define met(a,b) mem

2017-08-24 10:34:36 193

原创 LeetCode 396. Rotate Function

题目链接:https://leetcode.com/problems/rotate-function/description/题解:一道很好的思维题,我们可以这么去进行思考,将一个状态变成下一个需要的状态,就是将上一个状态的最后的一个数移动到前面,在对其进行求和,其实相当于当前的最后一个数为0,其他的数全部加一。推一下很容易就能推出来。代码:class Solution {public:

2017-08-21 14:03:43 292

原创 KMP 算法持续更新

1.HDU1711 KMP模版题 代码:#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;#define inf 0x3f3f3f3#define met(a,b) memset(a,b,sizeof(a))const int maxn = 1e

2017-08-20 22:13:01 281

原创 HihoCoder #1513 : 小Hi的烦恼

题目链接:https://hihocoder.com/problemset/problem/1513题解:论bitset的重要行。 看完题目,很明显,如果用常规的方法,每一次都进行处理。那么,很明显会超时。因此,我们可以使用状态的压缩来做这道题目。 关于Bitset的具体的用法,这里贴个链接:http://www.voidcn.com/article/p-cflemkip-cs.html 因此

2017-08-17 10:34:25 403

原创 二叉树遍历问题

前序中序求后序代码:#include <map>#include <cmath>#include <cstdio>#include <vector>#include <cstring>#include <iostream>#include <algorithm>using namespace std;#define met(a,b) memset(a,b,sizeof(a))#de

2017-08-16 15:53:13 219

原创 LeetCode 318. Maximum Product of Word Lengths

题目链接:https://leetcode.com/problems/maximum-product-of-word-lengths/description/题解:一道很有趣的题目,用常规的思路,时间应该是O(n^3),应该是会超时的(虽然自己没有试过。。。。。。),因此,我们就需要优化自己的算法, 我们可以对字符先进行预处理,这里我们可以对于每一个字符串进行状态的压缩,这样的话,我们在对其求长度

2017-08-16 10:46:13 202

原创 LeetCode 560. Subarray Sum Equals K

题目链接: https://leetcode.com/problems/subarray-sum-equals-k/description/ 题解: 先一个For过去,记录下每次前缀和的出现的次数。对于查找第K大的,那么只要对于当前的前缀和,找到其减去K之后数字,它出现的次数,加一下就行了。因为对于当前数列的前缀和,他一定是从1到N,所以减掉K之后,一定是满足连续的这个条件的。 代码:cla

2017-08-15 12:45:09 283

空空如也

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除