简单数据结构应用
等我学会后缀自动机
侠影之谜
展开
-
Gym 101142G Gangsters in Central City (动态倍增LCA+DFS序性质)
#include<bits/stdc++.h>using namespace std;#define debug cout<<"YES\n";#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll long long#define lrt int l,int r,int rt#define ...原创 2020-02-16 22:19:30 · 189 阅读 · 0 评论 -
CodeForces 382C Arithmetic Progression (模拟+细节)
题目链接:http://codeforces.com/problemset/problem/382/C#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll lon...原创 2018-12-03 23:42:16 · 356 阅读 · 0 评论 -
HDU 6180 Schedule (贪心)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6180#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll lon...原创 2018-12-10 09:58:53 · 179 阅读 · 0 评论 -
Codeforces Round #536 (Div. 2) E. Lunar New Year and Red Envelopes(DP+muitiset优化)
题目链接:http://codeforces.com/contest/1106/problem/E#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll long ...原创 2019-02-03 20:24:20 · 149 阅读 · 0 评论 -
HDU 5876 Sparse Graph (DFS+补图)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5876#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll uns...原创 2019-02-07 21:29:59 · 213 阅读 · 0 评论 -
CSU 1811 Tree Intersection (map启发式合并+树形DP)
题目链接:http://acm.csu.edu.cn:20080/csuoj/problemset/problem?pid=1811题目大意:给定一颗树,树上每个节点都有颜色,问对于每条边,其两端子树颜色集合交集的大小。题目分析: 相比于上次用线段树动态开点类似的方法来做合并,这次用map做启发式合并,这样的复杂度会因为每次都合并小的而降维。这道题同时还嵌套着树形D...原创 2019-02-24 09:36:53 · 186 阅读 · 0 评论 -
HDU 5738 Eureka (组合计数+map数据结构的使用+暴力)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5738题目大意:给定二维平面上若干个点,要求计算满足条件的集合P的数量,其中集合P需要满足条件,该集合中存在一个点对,其约束关系如题干所述。题目分析: 简单换算下不难发现其需要找若干个点共线的集合,该集合至少两个点。该题没什么好方法,只有暴力,,虽然我不大懂这题最坏复杂...原创 2019-02-24 22:30:18 · 175 阅读 · 0 评论 -
CodeForces 916D Jamie and To-do List (主席树+map)
题目链接:http://codeforces.com/problemset/problem/916/D题目大意给定四种操作,第一种:设定字符串的优先级,若该字符串事先没有出现过,则添加上去,否则修改。第二种:删除操作,删除指定的字符串第三种:返回操作,回退k个操作,第四种:查询指定字符串,其有多少个字符串的优先级小于它。题目分析看到时间回退操作不难想到可持久化,...原创 2019-03-20 15:07:07 · 237 阅读 · 0 评论 -
Educational Codeforces Round 61 (Rated for Div. 2) D. Stressful Training(贪心+二分+优先队列)
题目链接:http://codeforces.com/contest/1132/problem/D题目大意每个同学电脑有初始电量和电量消耗速度,这堂课有k分钟,其损耗过程有note描述。现在有个输出x,每分钟可以指定一个电脑并充电x,问要维护每位同学电脑电量始终不小于零,其最小的x是多少。题目分析这道题思路倒是蛮容易想的,就是细节比较多!可以看出是二分,并且二分上界是...原创 2019-03-16 19:26:10 · 262 阅读 · 0 评论 -
CodeForces 977F Consecutive Subsequence (贪心+DP)
题目链接:http://codeforces.com/problemset/problem/977/F贪心性质+DP#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#de...原创 2019-04-26 17:18:56 · 151 阅读 · 0 评论 -
Codeforces Round #552 (Div. 3) E Two Teams (链表模拟)
题目链接:http://codeforces.com/contest/1154题目大意给定一个序列,每次老师把序列中的最大值及其附近的k个人(如果不足则割舍)加到他的阵营,总共有两名老师轮番做这个操作,输出一个序列表示每个人都在哪个阵营.题目分析k和n的数量级都是五次方,很迷惑人,其实不难发现每个数只会被用到一次,那么我们不妨用链表来跳跃性的映射关系,初...原创 2019-05-01 22:08:34 · 122 阅读 · 0 评论 -
HDU 6326 Problem H. Monster Hunter (贪心+优先队列)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6326#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll lon...原创 2018-11-08 11:16:07 · 206 阅读 · 0 评论 -
CodeForces - 496E Distributing Parts (贪心+数据结构应用)
题目链接:http://codeforces.com/problemset/problem/496/E#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll lon...原创 2018-10-16 16:51:13 · 187 阅读 · 0 评论 -
HDU 6444 Neko's loop (单调队列+带限制的最大子段和)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6444#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define read(x...原创 2018-10-09 11:47:08 · 324 阅读 · 0 评论 -
HDU Difference (折半二分思想 + 数据结构的使用)
DifferenceTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1432 Accepted Submission(s): 392Problem DescriptionLittle Ruins is playing a number...原创 2018-07-13 23:36:43 · 209 阅读 · 1 评论 -
HDU 3887 Counting Offstring (DFS序+线段树结构模板题)*
Counting OffspringTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3457 Accepted Submission(s): 1181Problem Description You are given a tree,...原创 2018-07-15 10:57:51 · 167 阅读 · 0 评论 -
HDU 6319 Problem A. Ascending Rating (单调队列+经验细节)
Problem A. Ascending Rating Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 2057 Accepted Submission(s): 622 Problem De...原创 2018-07-31 10:16:18 · 198 阅读 · 0 评论 -
牛客网多校赛6 ASinging Contest (数据结构应用+模拟)
链接:https://www.nowcoder.com/acm/contest/144/A来源:牛客网 题目描述Jigglypuff is holding a singing contest. There are 2n singers indexed from 1 to 2n participating in the contest.The rule of this contest ...原创 2018-08-04 22:13:00 · 214 阅读 · 0 评论 -
HDU 6301 Distinct Values (贪心做法维护mex)技巧
Distinct ValuesTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3974 Accepted Submission(s): 1334 Problem DescriptionChiaki has an arr...原创 2018-07-31 16:00:38 · 164 阅读 · 0 评论 -
POJ 3250 Bad Hair Day (单调栈应用)
Some of Farmer John's N cows (1 ≤ N ≤ 80,000) are having a bad hair day! Since each cow is self-conscious about her messy hairstyle, FJ wants to count the number of other cows that can see the top of ...原创 2018-08-06 06:48:39 · 130 阅读 · 0 评论 -
HDU 6438 Buy and Resell (贪心好题+优先队列)*
Buy and Resell Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1580 Accepted Submission(s): 548 Problem Description Th...原创 2018-08-27 16:48:01 · 129 阅读 · 0 评论 -
徐州网络赛 G Trace (思维题+set集合性质)
题目链接:https://nanti.jisuanke.com/t/31459#include<bits/stdc++.h>#pragma comment(linker,"/STACK:1024000000,1024000000")using namespace std;#define debug puts("YES");#define rep(x,y,z) for(i...原创 2018-09-11 12:06:50 · 227 阅读 · 0 评论 -
ACM-ICPC 2018 徐州赛区网络预赛F. Features Track (数据结构map的使用)
题目链接:https://nanti.jisuanke.com/t/31458#include<bits/stdc++.h>#pragma comment(linker,"/STACK:1024000000,1024000000")using namespace std;#define debug puts("YES");#define rep(x,y,z) for(i...原创 2018-09-09 23:51:32 · 190 阅读 · 0 评论 -
CodeForces - 689E Mike and Geometry Problem(离散化+组合数+标记法求区间和+map)*
题目链接:http://codeforces.com/problemset/problem/689/E#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define read(x...原创 2018-09-27 00:00:02 · 149 阅读 · 0 评论 -
Codeforces round 488 div2 B. Knights of a Polygonal Table
B. Knights of a Polygonal Tabletime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputUnlike Knights of a Round Table, Knights of a Polygonal Table depriv...原创 2018-06-23 19:56:48 · 149 阅读 · 0 评论