HDU
Aurum_potestas_est
这个作者很懒,什么都没留下…
展开
-
HDU3709
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;typedef __int64 ll;ll len,wei[22];ll dp[22][22][2005];//hdu3709平衡数ll dfs(ll pos,ll pre,ll o,ll limit){//limit代表当前数字有没有上原创 2017-09-22 15:39:58 · 330 阅读 · 0 评论 -
HDU3333 线段树+离线询问
After inventing Turing Tree, 3xian always felt boring when solving problems about intervals, because Turing Tree could easily have the solution. As well, wily 3xian made lots of new problems about int...原创 2018-07-18 18:59:00 · 248 阅读 · 0 评论 -
hdu4638莫队
Problem Description There are n men ,every man has an ID(1..n).their ID is unique. Whose ID is i and i-1 are friends, Whose ID is i and i+1 are friends. These n men stand in line. Now we select an in...原创 2018-07-18 16:16:34 · 213 阅读 · 0 评论 -
HDU5039线段树+dfs序
Problem Description After June 1st, elementary students of Ted Land are still celebrating “The Sacred Day of Elementary Students”. They go to the streets and do some elementary students stuff. So we ...原创 2018-04-20 17:00:17 · 260 阅读 · 0 评论 -
HDU3887 dfs序+线段树
Problem Description You are given a tree, it’s root is p, and the node is numbered from 1 to n. Now define f(i) as the number of nodes whose number is less than i in all the succeeding nodes of node ...原创 2018-04-19 21:25:11 · 517 阅读 · 1 评论 -
kruskal模板
Problem Description 某省调查乡村交通状况,得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可),并要求铺设的公路总长度为最小。请计算最小的公路总长度。Input 测试输入包含若干测试用例。每个测试用例的第1行给出村庄数目N ( < 100 );随后的N(N-...原创 2018-02-15 22:15:50 · 170 阅读 · 0 评论 -
uva 12012 - Detection of Extraterrestrial(KMP)
Input The first line contains T, the number of test cases (T ≤ 200). Most of the test cases are relatively small. T lines follow, each contains a string of only small latin letters ’a’ - ’z’, whose l原创 2017-10-07 19:29:30 · 429 阅读 · 0 评论 -
HDU2594 Simpsons’ Hidden Talents
Input Input consists of two lines. The first line contains s1 and the second line contains s2. You may assume all letters are in lowercase. Output Output consists of a single line that contains the原创 2017-10-07 19:12:24 · 331 阅读 · 0 评论 -
HDU2795
题意:有一块尺寸为h*w的矩形长板,要在上面贴1*wi的海报n张,选择贴海报的位置是:尽量高,同一高度,选择尽量靠左的地方。要求输出每张海报的高度位置。 思路:因为海报的宽度都是1,就可以把长板旋转90°(长变成高,高变成长),把底层的每张海报当作单个结点(线段树中 tree[root].l==tree[root].r的点)用来表示高度。 因为只有200000个点,所以线段树原创 2017-09-23 21:25:14 · 264 阅读 · 0 评论 -
HDU1698
Problem Description In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks which are of the same原创 2017-09-23 20:27:17 · 293 阅读 · 0 评论 -
HDU1166
Problem Description C国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段,所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人数都有可能发生变动,可能增加或减少若干人手,但这些都逃不过C国的监视。原创 2017-09-23 20:07:55 · 269 阅读 · 0 评论 -
HDU1754
Problem Description 很多学校流行一种比较的习惯。老师们很喜欢询问,从某某到某某当中,分数最高的是多少。 这让很多学生很反感。不管你喜不喜欢,现在需要你做的是,就是按照老师的要求,写一个程序,模拟老师的询问。当然,老师有时候需要更新某位同学的成绩。Input 本题目包含多组测试,请处理到文件结束。 在每个测试的第一行,有两个正整数 N 和 M ( 0#include<std原创 2017-09-23 20:02:09 · 286 阅读 · 0 评论 -
hdu6319 单调栈
#include<stdio.h>#include<iostream>#include<string.h>#include<math.h>#include<algorithm>#include<queue>#include<stack>using namespace std;typedef long原创 2018-07-30 21:29:38 · 483 阅读 · 0 评论