acm
樽丶
这个作者很懒,什么都没留下…
展开
-
F - Square, Not Rectangle Gym - 102760F(ST表区间维护最小值+二分)
A histogram is a polygon made by aligning N adjacent rectangles that share a common base line. Each rectangle is called a bar. The i-th bar from the left has width 1 and height Hi.Your goal is to find the area of the largest rectangle contained in the giv原创 2020-12-19 22:53:20 · 281 阅读 · 1 评论 -
Kingpin Escape Gym - 102007K
K Kingpin Escape Time limit: 2sYou are the kingpin of a large network of criminal hackers. Legend has it there has never been a richer criminalthan you. Not just because you are the smartest, but alsobecause you are the stingiest.The police have been a原创 2020-12-09 23:10:42 · 176 阅读 · 0 评论 -
Problem C. String Game (dp)
Problem C. String GameInput file: standard inputOutput file: standard outputTime limit: 1 secondMemory limit: 256 megabytesClair and Bob play a game. Clair writes a string of lowercase characters, in which Bob sets the puzzleby selecting one of his f原创 2020-11-23 20:06:58 · 546 阅读 · 0 评论 -
80 Days HihoCoder - 1831
80 Days is an interesting game based on Jules Verne’s science fiction “Around the World in Eighty Days”. In this game, you have to manage the limited money and time.Now we simplified the game as below:There are n cities on a circle around the world which原创 2020-11-22 00:24:02 · 100 阅读 · 0 评论 -
Saving Tang Monk II HihoCoder - 1828(三维bfs记录)
《Journey to the West》(also 《Monkey》) is one of the Four Great Classical Novels of Chinese literature. It was written by Wu Cheng’en during the Ming Dynasty. In this novel, Monkey King Sun Wukong, pig Zhu Bajie and Sha Wujing, escorted Tang Monk to India to原创 2020-11-22 00:03:16 · 122 阅读 · 0 评论 -
Monitor CodeForces - 846D(二维前缀和+二分)
Recently Luba bought a monitor. Monitor is a rectangular matrix of size n × m. But then she started to notice that some pixels cease to work properly. Luba thinks that the monitor will become broken the first moment when it contains a square k × k consisti原创 2020-11-21 23:49:51 · 264 阅读 · 0 评论 -
K-th Beautiful String CodeForces - 1328B(一维前缀和)
For the given integer n (n>2) let’s write down all the strings of length n which contain n−2 letters ‘a’ and two letters ‘b’ in lexicographical (alphabetical) order.Recall that the string s of length n is lexicographically less than string t of length原创 2020-11-21 23:34:04 · 123 阅读 · 0 评论 -
食物链 POJ - 1182(并查集)
食物链 POJ - 1182动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。现有N个动物,以1-N编号。每个动物都是A,B,C中的一种,但是我们并不知道它到底是哪一种。有人用两种说法对这N个动物所构成的食物链关系进行描述:第一种说法是"1 X Y",表示X和Y是同类。第二种说法是"2 X Y",表示X吃Y。此人对N个动物,用上述两种说法,一句接一句地说出K句话,这K句话有的是真的,有的是假的。当一句话满足下列三条之一时,这句话就是假话,否则就是真话。原创 2020-11-20 18:30:14 · 131 阅读 · 0 评论 -
Clock HDU - 6551 模拟
wls 有一个钟表,当前钟表指向了某一个时间。又有一些很重要的时刻,wls 想要在钟表上复现这些时间(并不需要依次复现)。我们可以顺时针转动秒针,也可以逆时针转动秒针,分针和时针都会随着秒针按规则转动,wls 想知道秒针至少转动多少角度可以使每个时刻至少都会被访问一次。注意,时钟上的一种时针分针秒针的组合,可以代表两个不同的时间。Input第一行一个整数 n 代表有多少个时刻要访问。第二行三个整数 h,m,s 分别代表当前时刻的时分秒。最后n行每一行三个整数 hi,mi,si 代表每个要访问的时原创 2020-11-12 23:46:13 · 207 阅读 · 0 评论 -
Pots POJ - 3414
You are given two pots, having the volume of A and B liters respectively. The following operations can be performed:FILL(i) fill the pot i (1 ≤ i ≤ 2) from the tap;DROP(i) empty the pot i to the drain;POUR(i,j) pour from pot i to pot j; after this opera原创 2020-10-31 10:55:20 · 143 阅读 · 0 评论 -
Physical Examination HDU - 4442
**Physical Examination HDU - 4442 **WANGPENG is a freshman. He is requested to have a physical examination when entering the university.Now WANGPENG arrives at the hospital. Er…… There are so many students, and the number is increasing!There are many ex原创 2020-10-31 10:53:44 · 142 阅读 · 0 评论 -
HDU 3791 二叉搜索树
HDU 3791 二叉搜索树判断两序列是否为同一二叉搜索树序列Input开始一个数n,(1<=n<=20) 表示有n个需要判断,n= 0 的时候输入结束。接下去一行是一个序列,序列长度小于10,包含(0~9)的数字,没有重复数字,根据这个序列可以构造出一颗二叉搜索树。接下去的n行有n个序列,每个序列格式跟第一个序列一样,请判断这两个序列是否能组成同一颗二叉搜索树。Output如果序列相同则输出YES,否则输出NOSample Input256743254326757634原创 2020-10-31 10:46:11 · 65 阅读 · 0 评论 -
7-7 社交网络图中结点的“重要性”计算 (30分) floyd
7-7 社交网络图中结点的“重要性”计算 (30分)输入格式:输入第一行给出两个正整数N和M,其中N(≤104 )是图中结点个数,顺便假设结点从1到N编号;M(≤105 )是边的条数。随后的M行中,每行给出一条边的信息,即该边连接的两个结点编号,中间用空格分隔。最后一行给出需要计算紧密度中心性的这组结点的个数K(≤100)以及K个结点编号,用空格分隔。输出格式:按照Cc(i)=x.xx的格式输出K个给定结点的紧密度中心性,每个输出占一行,结果保留到小数点后2位。输入样例:9原创 2020-10-25 14:29:53 · 936 阅读 · 0 评论 -
6-12 二叉搜索树的操作集 (30分)
本题要求实现给定二叉搜索树的5种常用操作。函数接口定义:BinTree Insert( BinTree BST, ElementType X );BinTree Delete( BinTree BST, ElementType X );Position Find( BinTree BST, ElementType X );Position FindMin( BinTree BST );Position FindMax( BinTree BST );其中BinTree结构定义如下:typede原创 2020-10-19 22:59:42 · 104 阅读 · 0 评论 -
Pots POJ - 3414 非常可乐 HDU - 1495 bfs(倒水问题)
You are given two pots, having the volume of A and B liters respectively. The following operations can be performed:FILL(i) fill the pot i (1 ≤ i ≤ 2) from the tap;DROP(i) empty the pot i to the drain;POUR(i,j) pour from pot i to pot j; a原创 2020-08-21 14:46:08 · 147 阅读 · 0 评论 -
Tetrahedron HDU - 6814 数学推导+预处理
Generate three integers a, b, and c in [1,n] with equal probability independently, and use them as the three right-angle side length of a right-angled tetrahedron. Find the expectation of the reciprocal square of the distance from the right-angle apex to t原创 2020-08-12 20:08:49 · 212 阅读 · 0 评论 -
The Oculus HDU - 6768(ull自然取余溢出 哈希)
Let’s define the Fibonacci sequence F1,F2,… as F1=1,F2=2,Fi=Fi−1+Fi−2 (i≥3).It’s well known that every positive integer x has its unique Fibonacci representation (b1,b2,…,bn) such that:· b1×F1+b2×F2+⋯+bn×Fn=x.· bn=1, and for each i (1≤i<n), bi∈{0,1}原创 2020-08-11 19:08:40 · 351 阅读 · 0 评论 -
Parentheses Matching HDU - 6799 deque+stack
Given a string P consisting of only parentheses and asterisk characters (i.e. “(”, “)” and “"), you are asked to replace all the asterisk characters in order to get a balanced parenthesis string with the shortest possible length, where you can replace each原创 2020-08-11 18:35:10 · 98 阅读 · 0 评论 -
HZNUOJ B_M的忧虑 矩阵快速幂
B_M的忧虑DescriptionB_M学长喜欢减肥,为此他制定出了一个详细的减肥计划。因为这个计划过于详细,所以他甚至可以推算出在未来的某一天自己的体重。 体重的计算规律如下:要计算出自己某一天的体重,需要通过在此之前n天的体重来计算 设wx为第x天的体重,那么wx=∑ni=1(ai × wx−i) , 其中 ai 是给定的常数 现在给出B_M前n天的体重,询问他第x天的体重,题目保证x>nInput输入数据的第一行是两个正整数 n (1≤n≤100)和 x (原创 2020-08-08 14:25:45 · 226 阅读 · 0 评论 -
HZNUOJ 2803 二维前缀和+gcd
神枪手JoneySun (Easy Version)Time Limit: 1 s Memory Limit: 256 MBSubmission:146 AC:32 Score:100.00DescriptionEasy Version 和 a little bit hard Version 只有数据范围的区别JoneySun被邪恶的wifepie困在了一个由1×1的网格分割的监狱里,邪恶的wifepie为了看JoneySun的笑话,在监狱里的某处监视着JoneyS原创 2020-08-07 23:17:36 · 290 阅读 · 0 评论 -
dijkstra+链式前向星+优先队列优化
Invitation Cards POJ - 1511Descriptionn-1个人从1号点出发,到剩余n-1个宣传点,然后再回到1号点汇报结果,求所有人往返路径和的最小值Input输入由T个案例组成。输入的第一行只包含正整数T。接下来是N和M,1 <= N,M <= 1000000,表示N个点和连接N个点的M条边。然后有M行,每行包括三个值U,V,W,表示从点U到点V需要W的路程。你可以假设该图连通。注意是单向通道!!!Output对于每个案例,打印一行,表示路径总和的最小原创 2020-08-03 14:49:40 · 290 阅读 · 0 评论 -
二叉树相关
二叉树板子struct node { int value; node* l, * r; node(int value = 0, node * l = NULL, node * r = NULL) :value(value), l(l), r(r) {};};int pre[maxn], in[maxn], post[maxn], image[maxn], k;void buildtree(node*& root, int add) {//插入建树 if (root == NULL)r原创 2020-07-29 10:55:20 · 218 阅读 · 1 评论 -
kmp A B C 题解
A poj 1961 PeriodFor each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is, for each i (2 <= i <= N) we want to know the l原创 2020-07-26 21:20:20 · 245 阅读 · 0 评论 -
kmp算法理解
kmp算法模板理解kmp是一种在任何情况下都能达到O(n+m)复杂度的算法。它是如何做到的呢?简单的说,它通过分析p的特征对p进行预处理,从而在与s匹配的时候能够跳过一些字符串,达到快速匹配的目的。kmp由两个函数部分组成——getFail()和kmp算法学习和推导过程参考博客kmpgetFail根据目标字符串的前后缀最大公共元素长度,,整体右移一个单位,并且为第一个元素赋初值为-1,得出next数组。把next 数组跟之前求得的最大长度表对比后,不难发现,next 数组相当于“最大长度值”原创 2020-07-12 23:26:18 · 369 阅读 · 0 评论 -
HZNUOJ1586—删字符 题解
HZNUOJ1586—删字符 题解题目链接问题描述Description给出字符和字符串,从字符串中删除指定字符并输出。例如从字符串"AscADef"中删除’A’后,字符串为"scDef"。Input需要删除的字符ch。需要处理的字符串(长度不超过1000)。Output处理后的字符串。SamplesinputAAscADefoutputscDef简单的字符串处理遍历寻找目标字符逐个输出即可#include<stdio.h>#include<strin原创 2020-07-01 18:21:24 · 732 阅读 · 2 评论