- 博客(48)
- 收藏
- 关注
原创 POJ-Keywords Search(AC自动机模板题)
D - Keywords SearchTime Limit:1000MS Memory Limit:131072KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2222DescriptionIn the modern time, Search engine came
2016-07-31 17:55:24 694
原创 POJ-Colored Sticks(字典树+并查集+欧拉回路)
A - Colored SticksTime Limit:5000MS Memory Limit:128000KB 64bit IO Format:%lld & %lluSubmit Status Practice POJ 2513DescriptionYou are given a bunch of wooden sticks. Eac
2016-07-31 13:15:24 784
原创 河南多校大一训练赛(容斥原理+数论+DP+01背包)
容斥原理 编辑在计数时,必须注意没有重复,没有遗漏。为了使重叠部分不被重复计算,人们研究出一种新的计数方法,这种方法的基本思想是:先不考虑重叠的情况,把包含于某内容中的所有对象的数目先计算出来,然后再把计数时重复计算的数目排斥出去,使得计算的结果既无遗漏又无重复,这种计数的方法称为容斥原理。两个集合的容斥关系公式:A∪B =|A∪B| = |A|+|B| - |A∩B
2016-07-30 23:34:48 552
原创 河南多校大一训练赛(贪心)
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice OpenJ_Bailian 4120Description宇航员Bob有一天来到火星上,他有收集硬币的习惯。于是他将火星上所有面值的硬币都收集起来了,一共有
2016-07-30 23:13:24 792
原创 河南多校大一训练赛 frog(拓展欧几里得)
Description两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到碰面为止。可是它们出发之前忘记了一件很重要的事情,既没有问清楚对方的特征,也没有约定见面的具体位置。不过青蛙们都是很乐观的,它们觉得只要一直朝着某个方向跳下去,总能碰到对方的。但是除非这两只青蛙在同一时间跳到同一点上,不然是永远都不可能碰面
2016-07-30 21:08:19 938
原创 河南多校大一训练赛 取模(模拟题)
D - F是签到题Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1078 uDebugDescriptionIf an integer is not divisible by 2 or 5, so
2016-07-30 21:04:51 742
原创 河南多校大一训练赛(最小生成树k算法)
B - F是签到题Time Limit:8000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice Aizu 2224DescriptionNicholas Y. Alford was a cat lover. He had a garden
2016-07-30 20:58:46 523
原创 河南多校大一训练赛 (田忌赛马)
A - F是签到题Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionYour karate club challenged another karate club in your town. Each club ent
2016-07-30 17:00:50 790
原创 codeforces-Powers of Two(map的应用)
B. Powers of Twotime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given n integers a1, a2, ..., an.
2016-07-30 01:53:20 535
原创 POJ-3630 Phone List(字典树)
P - Phone ListTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionGiven a list of phone numbers, determine if it is consistent in th
2016-07-29 14:42:14 538
原创 HDU-1251 统计难题(map)
J - 统计难题Time Limit:2000MS Memory Limit:65535KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionIgnatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数
2016-07-29 10:50:44 603
原创 HDU-1251 统计难题(字典树+map)
J - 统计难题Time Limit:2000MS Memory Limit:65535KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionIgnatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数
2016-07-29 10:48:48 410
原创 多校训练-Bubble Sort(树状数组+离散化)
Bubble SortTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem DescriptionP is a permutation o
2016-07-28 17:13:11 466
转载 字典树(模板+总结)
字典树 编辑又称单词查找树,Trie树,是一种树形结构,是一种哈希树的变种。典型应用是用于统计,排序和保存大量的字符串(但不仅限于字符串),所以经常被搜索引擎系统用于文本词频统计。它的优点是:利用字符串的公共前缀来减少查询时间,最大限度地减少无谓的字符串比较,查询效率比哈希树高。它有3个基本性质:根节点不包含字符,除根节点外每一个节点都只包含一个字符; 从根节点
2016-07-28 11:21:50 489
原创 POJ-Palindrome(马拉车模板题)
F - PalindromeTime Limit:15000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice POJ 3974DescriptionAndy the smart computer science student was att
2016-07-27 21:35:25 534
原创 POJ-3080 Blue Jeans(纯暴力)
C - Blue JeansTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice POJ 3080DescriptionThe Genographic Project is a research partners
2016-07-27 20:09:26 491
转载 POJ-多边形的应用(皮克公式)
C - AreaTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld & %lluSubmit Status Practice POJ 1265DescriptionBeing well known for its highly innovative products,
2016-07-27 18:04:04 1090
原创 POJ-2503 Babelfish(map模板题)
A - BabelfishTime Limit:3000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionYou have just moved from Waterloo to a big city. The people here spea
2016-07-27 15:08:40 566
原创 河南多校暑期集训-Catch That Cow(广搜)
G - Catch That CowTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionFarmer John has been informed of the location of a fugitive
2016-07-27 12:59:44 447
原创 HDU-1358 Period(kmp专题)
E - PeriodTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1358DescriptionFor each prefix of a given string S with N charact
2016-07-27 11:43:23 504
原创 POJ-2752 Seek the Name, Seek the Fame(kmp中next数组的应用)
H - Seek the Name, Seek the FameTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice POJ 2752DescriptionThe little cat is so famous, t
2016-07-27 10:17:30 405
原创 HDU-3746 Cyclic Nacklace(kmp专题)
D - Cyclic NacklaceTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 3746DescriptionCC always becomes very depressed at the e
2016-07-26 10:43:46 607
原创 HDU-1686 Oulipo(kmp模板题)
B - OulipoTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1686DescriptionThe French author Georges Perec (1936–1982) once w
2016-07-25 21:15:09 603
原创 HDU 1711 Number Sequence(kmp专题)
A - Number SequenceTime Limit:5000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1711DescriptionGiven two sequences of numbers : a[1], a[
2016-07-25 21:04:48 513
原创 POJ -2406 Power Strings(循环节,kmp专题)
A - Power StringsTime Limit:3000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionGiven two strings a and b we define a*b to be their concatenati
2016-07-25 20:34:50 519
原创 HDU-4027 Can you answer these queries?(线段树专题)
Can you answer these queries?Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 12675 Accepted Submission(s): 3015Problem Descriptio
2016-07-24 19:55:20 454
原创 HDU-1698 Just a Hook(线段树模板)
Just a HookTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 27332 Accepted Submission(s): 13572Problem DescriptionIn the game
2016-07-24 18:33:02 478
原创 Bestcoder_Dertouzos
Dertouzos Accepts: 76 Submissions: 1357 Time Limit: 7000/3500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)问题描述正整数xx称为nn的positive proper divisor, 当且仅当x | nx
2016-07-24 14:23:34 426
原创 Bestcoder-Aaronson
Aaronson Accepts: 632 Submissions: 1442 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Problem DescriptionRecently, Peter saw the
2016-07-23 19:47:22 532 1
原创 HDU-1754 O - I Hate It(线段树求最值)
O - I Hate ItTime Limit:3000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription很多学校流行一种比较的习惯。老师们很喜欢询问,从某某到某某当中,分数最高的是多少。这让很多学生很反感。不管你喜不喜欢,现在
2016-07-22 20:00:36 376
原创 RMQ(各方归纳)
大神链接:http://www.mirac1e.com/2016/01/05/rmq%E6%A8%A1%E6%9D%BF/(rmq)概述:MQ(Range Minimum/Maximum Query),即区间最值查询,是指这样一个问题:对于长度为n的数列A,回答若干询问RMQ(A,i,j)(i,j算法。当然,该问题也可以用线段树(也叫区间树)解决,算法复杂度为:O(N)~O(logN)
2016-07-22 19:05:00 398
原创 POJ-3468 A Simple Problem with Integers(线段树模板题)
J - A Simple Problem with IntegersTime Limit:5000MS Memory Limit:131072KB 64bit IO Format:%lld & %lluSubmit StatusDescription给出了一个序列,你需要处理如下两种询问。"C a b c"表示给[a, b]区间中的值全部
2016-07-22 17:30:38 635
原创 HDU-1114 Piggy-Bank(完全背包问题)
Piggy-BankTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20365 Accepted Submission(s): 10354Problem DescriptionBefore ACM ca
2016-07-22 14:41:07 497
原创 HDU-1166 敌兵布阵(线段树模板题)
N - 敌兵布阵Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionLily 特别喜欢养花,但是由于她的花特别多,所以照料这些花就变得不太容易。她把她的花依次排成一行,每盆花都有一个美观值。如果Lily把某盆
2016-07-21 21:22:08 1069
原创 多校比赛—It's All In The Mind
It's All In The MindTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem DescriptionProfessor Z
2016-07-21 14:17:23 465
原创 POJ-1276 Alignment ( 多重背包)优化版
D - AlignmentTime Limit:1000MS Memory Limit:30000KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionIn the army, a platoon is composed by n soldiers. During the mornin
2016-07-20 21:14:41 364
原创 Cow Exhibition(多重背包问题)
U - Cow ExhibitionTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit StatusDescription"Fat and docile, big and dumb, they look so stupid, they aren'
2016-07-20 20:38:22 432
原创 NYOJ-单调递增最长子序列(两种算法)
单调递增最长子序列时间限制:3000 ms | 内存限制:65535 KB难度:4描述求一个字符串的最长递增子序列的长度如:dabdbf最长递增子序列就是abdf,长度为4输入第一行一个整数0随后的n行,每行有一个字符串,该字符串的长度不会超过10000输出输出字符串的最长递增子序列的长度样例输入3aaaababcabklm
2016-07-20 15:57:52 566
原创 HDU-Bone Collector(01背包问题)
Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 49837 Accepted Submission(s): 20878Problem DescriptionMany year
2016-07-20 13:15:27 502
原创 poj-1742 COINS(多重背包问题)
CoinsTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 34393 Accepted: 11676DescriptionPeople in Silverland use coins.They have coins of value A1,A2,A3...
2016-07-20 10:20:58 491
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人