- 博客(20)
- 收藏
- 关注
RSS订阅原创 Wannafly挑战赛10 F.小H和遗迹
时间限制：C/C++ 1秒，其他语言2秒空间限制：C/C++ 262144K，其他语言524288K 64bit IO Format: %lld题目描述 小H在一片遗迹中发现了一种古老而神秘的文字，这种文字也由26种字母组成，小H用小写字母来代替它们。遗迹里总共有N句话，由于年代久远，每句话都至少有一处无法辨识，用#表示，缺失的可能是任意长度(也包括0)的任意字符串。 小H发现这些话...
2018-02-26 22:29:19
576
原创 Sublime Text 3在Windows下配置C++环境
之前用codeblocks写c++，感觉c++语法很麻烦而且codeblocks界面和字体又不好看，所以一直不喜欢用c++写代码。最近感觉很有必要转一下c++，就在网上找更好看的编辑器，无奈vim和emacs上手都很慢，就找到了sublime text，感觉界面字体真的很棒棒啊，就愉快地决定以后用它写c++了。 sublime text给用户留下了很大的配置空间，c/c++的代码在win
2017-03-07 18:05:51
7537
原创 HDU-3397 线段树+区间合并
Sequence operationTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8068 Accepted Submission(s): 2416Problem Descriptionlxhgww
2017-02-06 23:30:36
538
原创 Nachos操作系统课设 浅谈优先级调度
题目Task1.5 实现优先级调度 Implement priority scheduling in Nachos by completing the PriorityScheduler class. Priority scheduling is a key building block in real-time systems. Note that in order to use
2016-12-23 23:36:17
2476
原创 POJ-2778 ac自动机+矩阵快速幂
DNA SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15422 Accepted: 5954DescriptionIt's well known that DNA Sequence is a sequence only contains
2016-10-02 16:49:27
552
原创 HDU-5893 树链剖分+区间合并
List wants to travelTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 446 Accepted Submission(s): 101Problem DescriptionA boy
2016-09-20 01:03:56
773
原创 UVA-11990 动态逆序对
题目链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3141题目大意：给出一个1-n的排列A，要求按照某种顺序删除一些数（其他数顺序不变），输出每次删除之前逆序对的数目。解题思路：动态逆序对，在线的话用块状数组
2016-09-16 11:57:29
821
原创 HDU-5324 cdq分治
Boring ClassTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1444 Accepted Submission(s): 460Problem DescriptionMr. Zstu and M
2016-09-15 19:16:38
830
转载 快速傅里叶变换入门
http://blog.miskcoo.com/2015/04/polynomial-multiplication-and-fast-fourier-transform
2016-09-04 17:45:29
995
原创 POJ-1741 点分治
TreeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 18156 Accepted: 5930DescriptionGive a tree with n vertices,each edge has a length(positive integer l
2016-08-24 16:53:01
491
原创 HDU-5371 Manacher+线段树维护
Hotaru's problemTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3123 Accepted Submission(s): 1057Problem DescriptionHotaru Ic
2016-08-10 15:40:57
471
原创 HDU-5790 Tire树+主席树
PrefixTime Limit: 2000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 474 Accepted Submission(s): 150Problem DescriptionAlice gets N strings.
2016-08-09 23:07:21
536
原创 HDU-5801 可持久化Trie树
Up Sky,Mr.ZhuTime Limit: 3000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 46 Accepted Submission(s): 14Problem DescriptionGiven a string S
2016-08-05 18:07:54
1648
原创 HDU-5785 Manacher+区间处理
InterestingTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 349 Accepted Submission(s): 121Problem DescriptionAlice get a st
2016-08-03 15:41:16
1146
原创 LightOJ-1031 博弈 区间DP
1031 - Easy Game PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBYou are playing a two player game. Initially there are n intege
2016-08-01 22:41:11
508
原创 LightOJ-1013 LCS+递推
1013 - Love Calculator PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBYes, you are developing a 'Love calculator'. The software
2016-08-01 17:54:47
484
原创 HDU-4729 树链剖分+主席树
An Easy Problem for ElfnessTime Limit: 5000/2500 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1207 Accepted Submission(s): 249Problem Description
2016-07-31 23:29:46
857
原创 POJ-1330 LCA的两种写法
方法一：RMQ对树做一次dfs序，记录每个节点在dfs序中的初始位置以及每个节点在树中的深度，查询两节点初始位置所形成的区间中深度最小的节点即为两者的最近公共祖先，查询部分采用RMQ即可。import java.util.*;public class Main { static int T,n,ee,a,b,c,kk,rt,ans; static int[] dd=new int[1
2016-06-11 22:28:36
496
原创 二分图最大权匹配--KM算法模板
KM算法我是看了训练指南学会的，指出上面的一处错误，当时纠结了好久才发现，在349页情况二中第一个S应该是S‘。模板代码如下：import java.util.*;public class Main { static int n,min; static int[] ss=new int[105]; static int[] tt=new int[105]; static int
2016-05-30 16:32:18
618
原创 GYM 100796C Minimax Tree
C. Minimax Treetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputBob's new favourite toy is a rooted tree tha
2015-12-20 19:46:07
820
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人