![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
HDU
八百标兵奔北坡666
这个作者很懒,什么都没留下…
展开
-
HDU.1002.A + B Problem II
A + B Problem IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 454726 Accepted Submission(s): 88102Problem DescriptionI have a very simp...原创 2019-01-05 21:09:34 · 145 阅读 · 0 评论 -
HDU3974.Assign the task(DFS序&&线段树)
Assign the task**题意:**给你一个有向树,然后可以执行两种操作:1.修改:将该点的子树节点都修改为同一个值。2.查询:单点查询,查询该点的值。**题解:**首先对于一个树形结构,可以用DFS序将它转化为线性结构,ll[x]和rr[x]为该店的左右端点,然后用那个线段树维护区间。#include<bits/stdc++.h>using namespace s...原创 2019-06-11 16:39:12 · 234 阅读 · 0 评论 -
HDU3068.(马拉车)
最长回文Problem Description给出一个只由小写英文字符a,b,c…y,z组成的字符串S,求S中最长回文串的长度.回文就是正反读都是一样的字符串,如aba, abba等Input输入有多组case,不超过120组,每组输入为一行小写英文字符a,b,c…y,z组成的字符串S两组case之间由空行隔开(该空行不用处理)字符串长度len <= 110000Output...原创 2019-04-14 23:26:20 · 188 阅读 · 1 评论 -
HDU1754.I Hate It(线段树)
I Hate ItTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 110189 Accepted Submission(s): 41188Problem Description很多学校流行一种比较的习惯。老师们很喜欢询问,从某...原创 2019-02-26 22:32:47 · 277 阅读 · 1 评论 -
HDU1180.诡异的楼梯.(bfs)
诡异的楼梯Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 20528 Accepted Submission(s): 5338Problem DescriptionHogwarts正式开学以后,Harry发现在Hogwart...原创 2019-02-28 18:23:11 · 261 阅读 · 1 评论 -
HDU.1708Fibonacci String(贪心)
Fibonacci StringTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7711 Accepted Submission(s): 2566Problem DescriptionAfter little Jim lear...原创 2019-02-17 22:39:38 · 234 阅读 · 0 评论 -
HDU1711(KMP算法)
Number SequenceTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 44477 Accepted Submission(s): 18293Problem DescriptionGiven two sequences...原创 2019-02-16 19:44:26 · 318 阅读 · 0 评论 -
河农大寒假训练2(DFS+BFS+枚举)
1.http://acm.hdu.edu.cn/showproblem.php?pid=1716简单数字全排列,用next_permutation进行排列,避免DFS,格式易错对应HDU1716#include&amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;lt;iostream&amp;amp;amp;amp;amp;amp;amp;amp;amp;amp;gt;#include&amp;amp;amp;am原创 2019-02-09 17:55:13 · 634 阅读 · 1 评论 -
HDU1009.FatMouse' Trade(贪心)
FatMouse’ TradeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 102206 Accepted Submission(s): 35663Problem DescriptionFatMouse prepared M...原创 2019-02-05 00:45:01 · 256 阅读 · 0 评论 -
HDU1263(map简单用法)
水果Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12599 Accepted Submission(s): 4995Problem Description夏天来了好开心啊,呵呵,好多好多水果Joe经营着一个不大的水果店....原创 2019-02-15 00:59:31 · 368 阅读 · 0 评论 -
2019杭电多校第九场 1002 Rikka with Cake(树状数组+离散化)
题意:在一个矩形中有若干条平行坐标轴的直线 ,求将矩形分成多少块。分析:根据离散数学公式可以推出分成的区域就是k条直线的交点数+1,将问题转化先将坐标离散化 然后对于其中为L方向的点加入树状数组, 依次枚举每各点的坐标如果方向向上 则查询树状数组后缀和 若向下 查询前缀和若向左则将树状数组的这个点删去 因为此后他不在贡献 若向右再加入树状数组 贡献一直到结尾位置//http://acm....原创 2019-08-20 16:25:53 · 200 阅读 · 0 评论