HDU
wang_hoho
这个作者很懒,什么都没留下…
展开
-
HDU - 1199 - Color the Ball(线段树)
Color the BallTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6005 Accepted Submission(s): 1503Problem DescriptionThere are i原创 2017-08-30 14:04:45 · 402 阅读 · 0 评论 -
HDU - 4911 - Inversion(树状数组逆序数+离散化)
InversionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 5238 Accepted Submission(s): 1839Problem Descriptionbobo has a seq原创 2017-11-20 12:23:04 · 237 阅读 · 0 评论 -
HDU - 1269 - 迷宫城堡(强连通)
迷宫城堡Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16605 Accepted Submission(s): 7237Problem Description为了训练小希的方向感,Gardon建立了原创 2017-07-26 20:57:24 · 190 阅读 · 0 评论 -
HDU - 4381 - Grid(01背包)
GridTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 971 Accepted Submission(s): 327Problem Description There are n boxes原创 2017-11-29 16:13:33 · 187 阅读 · 0 评论 -
HDU - 4907 - Task schedule (离线处理|预处理)
Task scheduleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3490 Accepted Submission(s): 1221Problem Description有一台机器,并且给你这台原创 2017-11-20 12:47:44 · 163 阅读 · 0 评论 -
HDU - 5934 - Bomb (强连通缩点)
BombTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2468 Accepted Submission(s): 777Problem DescriptionThere are N bombs needing exploding.Ea...原创 2017-11-06 22:07:42 · 235 阅读 · 0 评论 -
HDU - 2091 - 空心三角形(模拟)
空心三角形Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 49981 Accepted Submission(s): 13524Problem Description把一个字符三角形掏空,就能节原创 2017-11-24 20:29:22 · 294 阅读 · 0 评论 -
HDU - 1242 - Rescue (BFS)
RescueTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 32900 Accepted Submission(s): 11516Problem DescriptionAngel was cau原创 2017-11-24 20:51:48 · 184 阅读 · 0 评论 -
HDU - 5695 - Gym Class(DFS)
Gym ClassTime Limit: 6000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2106 Accepted Submission(s): 801Problem Description众所周知,度度熊喜欢各类体原创 2017-11-24 21:37:46 · 160 阅读 · 0 评论 -
HDU - 5543 - Pick The Sticks(DP)
Pick The SticksTime Limit: 15000/10000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 2484 Accepted Submission(s): 826Problem DescriptionThe story原创 2017-11-27 19:21:57 · 280 阅读 · 0 评论 -
HDU - 4786 - Fibonacci Tree (最小生成树 - Kurskal)
Fibonacci TreeTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5844 Accepted Submission(s): 1823Problem Description Coach原创 2017-11-28 23:10:15 · 186 阅读 · 0 评论 -
HDU - 3584 - Cube (树状数组+容斥)
CubeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 2383 Accepted Submission(s): 1219Problem DescriptionGiven an N*N*N cube原创 2017-11-01 21:25:41 · 238 阅读 · 0 评论 -
HDU - 1264 - Counting Squares (扫描线)
Counting SquaresTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2163 Accepted Submission(s): 1082Problem DescriptionYour inpu原创 2017-08-30 13:38:24 · 249 阅读 · 0 评论 -
HDU - 1394 - Minimum Inversion Number(树状数组、线段树)
Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21182 Accepted Submission(s): 12709Problem Description原创 2017-08-14 22:38:17 · 232 阅读 · 0 评论 -
HDU - 2852 - KiKi's K-Number(树状数组)
KiKi's K-NumberTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4158 Accepted Submission(s): 1875Problem DescriptionFor the k-原创 2017-08-13 10:39:31 · 227 阅读 · 0 评论 -
HDU - 3460 - Ancient Printer(字典树)
Ancient PrinterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 2067 Accepted Submission(s): 1033Problem DescriptionThe conte原创 2017-08-09 13:55:39 · 287 阅读 · 0 评论 -
HDU - 1247 - Hat's Words(字典树)
Hat’s WordsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15814 Accepted Submission(s): 5637Problem DescriptionA hat’s word原创 2017-08-08 20:30:42 · 202 阅读 · 0 评论 -
HDU - 2846 - Repository(字典树)
RepositoryTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 5624 Accepted Submission(s): 1868Problem DescriptionWhen you go sho原创 2017-08-08 19:36:10 · 176 阅读 · 0 评论 -
HDU - 5718 - Oracle
OracleTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1232 Accepted Submission(s): 532Problem DescriptionThere is once a ki原创 2017-11-09 20:51:07 · 134 阅读 · 0 评论 -
HDU - 4403 - A very hard Aoshu problem (DFS)
A very hard Aoshu problemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1740 Accepted Submission(s): 1197Problem Description原创 2017-11-09 21:07:12 · 199 阅读 · 0 评论 -
HDU - 3466 - Proud Merchants (01背包 + 排序)
Proud MerchantsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 7161 Accepted Submission(s): 2973Problem DescriptionRecen原创 2017-11-09 21:55:44 · 139 阅读 · 0 评论 -
HDU - 1166 - 敌兵布阵(树状数组、线段树)
敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 96925 Accepted Submission(s): 40988Problem DescriptionC国的死对头A国这段时间正在进行军事演原创 2017-08-13 11:33:27 · 175 阅读 · 0 评论 -
HDU - 3074 - Multiply game(线段树)
Multiply gameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2765 Accepted Submission(s): 977Problem DescriptionTired of play原创 2017-08-30 13:55:37 · 285 阅读 · 0 评论 -
HDU - 5461 - Largest Point(贪心,分类讨论)
HDU - 5461 - Largest Point题意:有一个数列 t ,以及两个整数a,b,求 的最大值。 只要找出t中最小值,次小值,最大值,次大值,绝对值最小值,然后全排列就能得到答案,注意不能取同一个#include <iostream>#include <string.h>#include <stdio.h>#incl...原创 2018-07-31 20:46:45 · 140 阅读 · 0 评论 -
HDU - 6336 - Problem E. Matrix from Arrays (规律+容斥)
HDU - 6336 - Problem E. Matrix from Arrays题意:按照题中所给代码构造一个无限的矩阵,求左上角为(x1,y1),右下角为(x2,y2)的子矩阵的权值和。int cursor = 0;for (int i = 0; ; ++i) { for (int j = 0; j <= i; ++j) { M[j][i - ...原创 2018-08-10 13:38:02 · 122 阅读 · 0 评论 -
HDU - 6342 - Problem K. Expression in Memories(模拟)
HDU - 6342 - Problem K. Expression in Memories题意:判断所给字符串能否形成一个正确表达式字符串中的 '?' 可以换成0~9,+,*正确的表达式有如下条件:每个数字不能有前导零(单个0不算),+和*不能相连+、*前面后面必须是数字 #include <iostream>#include <string.h...原创 2018-08-10 14:27:37 · 136 阅读 · 0 评论 -
HDU - 6343 - Problem L. Graph Theory Homework(不等式)
HDU - 6343 - Problem L. Graph Theory Homework题意:有 n 个点, 每个点均有一个权值wi,第 i 个点到第 j 个点的距离为⌊sqrt(|wi−wj|)⌋求出 1 到 n 的最短距离从 1 到 n 有两种选择1、直接1 -> n ,路径长度为⌊sqrt(|w1−wn|)⌋2、从1经过一些点然后再到n,设1->k-&g...原创 2018-08-10 14:50:21 · 124 阅读 · 0 评论 -
HDU - 5452 - Minimum Cut(树形DP)
HDU - 5452 - Minimum Cut题意:有一颗生成树和一些边,将边加入生成树中得到新的图,求最少删多少条边,使得图分为两块,其中有且仅有一条边是属于最初的生成树的,其余的为后来加的边中的。 因为必须要在最初的生成树切一条边,而且只能切一条边,所以分离的那一部分一定是原生成树的其中一个子树。我们就可以计算出所有子树分离出来要切去的边数,然后从中取出最小的即为答案...原创 2018-08-01 22:41:44 · 139 阅读 · 0 评论 -
HDU - 6341 - Problem J. Let Sudoku Rotate(DFS+剪枝)
HDU - 6341 - Problem J. Let Sudoku Rotate题意:一个16*16的数独,给你将其每块逆时针旋转一些次数后的状态,求出其恢复到数独条件满足最少要旋转多少次。 模拟每块逆时针旋转。每块旋转结束后在该块左上角就已经确定了,可以判断每行每列是否有相同的,用以剪枝。 #include <iostream>#include &l...原创 2018-08-11 18:36:50 · 224 阅读 · 0 评论 -
HDU - 6113 - 度度熊的01世界(搜索)
HDU - 6113 - 度度熊的01世界突然发现之前这道题目没过只要找出所有的0,1连通块,然后按条件输出就行了如果0连通块的边界是整个图的边界即说明这个0连通块没有被1连通块包围#include <iostream>#include <string.h>#include <stdio.h>#include <queue>...原创 2018-08-19 23:33:09 · 139 阅读 · 0 评论 -
HDU - 6408 - From ICPC to ACM(贪心)
HDU - 6408 - From ICPC to ACM题意:已知 k 个月每个月的具体信息,求满足客人需求的最小花费。每个月的信息如下:ci 表示第 i 个月的原材料价格di 表示第 i 个月需要卖出的电脑数量(顾客在第 i 个月的需求)mi 表示第 i 个月生产一台电脑的花费pi 表示第 i 个月能生产的电脑数量 ei 表示第 i 个月可以存到下个月的电...原创 2018-08-17 19:19:44 · 424 阅读 · 0 评论 -
HDU - 6435 - Problem J. CSGO(枚举)
HDU - 6435 - Problem J. CSGO题意:有 n 把主武器和 m 把副武器,每把武器有 k 种属性 x[i] 和综合得分 S,从中取出主副武器各一把求 的最大值其中MW表示主武器相关信息,SW表示副武器相关信息 如果绝对值不存在,我们只要找出 和 两者相加即为答案因为带有绝对值,处理变得不方便了,所以我们要去绝对值,由于 K 最大为 5 所以去...原创 2018-08-23 11:22:34 · 230 阅读 · 1 评论 -
HDU -6330 - Problem L. Visual Cube(模拟)
HDU -6330 - Problem L. Visual Cube题意:给一个长方体的长宽高,按照样例画出这一个长方体 /* 将其分为了如下两个部分来分别画出....+-+-+-+-+-+-+.../././././././|..+-+-+-+-+-+-+.+./././././././|/|+-+-+-+-+-+-+.+.+|.|.|.|.|.|.|/|/...原创 2018-08-09 15:42:31 · 128 阅读 · 0 评论 -
HDU - 6324 - Problem F. Grab The Tree(思维)
HDU - 6324 - Problem F. Grab The Tree题意:有一颗含有n个节点的生成树,每个节点都有各自的权值,Q要从这n个点中选出一些点,至少一个,这些点不能有相连的关系。这些点的权值的异或就是Q的得分,剩下的点的异或就是T的得分,问赢的人是谁。 设Q的得分为SQ,T的得分为ST,所有点的异或值为S。可以知道 SQ ^ ST = S。其中S是已知的,要...原创 2018-08-09 15:37:13 · 115 阅读 · 0 评论 -
HDU - 2157 - How many ways??(矩阵快速幂)
How many ways??Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3695 Accepted Submission(s): 1427Problem Description春天到了, HDU校原创 2017-08-07 21:34:32 · 202 阅读 · 0 评论 -
HDU - 3450 - Counting Sequences (线段树|树状数组 + 离散化)
Counting SequencesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/65536 K (Java/Others)Total Submission(s): 2680 Accepted Submission(s): 952Problem DescriptionFor a se原创 2018-01-23 17:07:55 · 247 阅读 · 0 评论 -
HDU - 3333 - Turing Tree(线段树+离线)
Turing TreeTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5672 Accepted Submission(s): 2025Problem DescriptionAfter inventin原创 2017-08-30 13:42:05 · 221 阅读 · 0 评论 -
HDU - 1542 - Atlantis (线段树扫描线)
AtlantisTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15584 Accepted Submission(s): 6396Problem DescriptionThere are severa原创 2018-01-29 13:27:11 · 209 阅读 · 0 评论 -
HDU - 1255 - 覆盖的面积(线段树)
覆盖的面积Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6172 Accepted Submission(s): 3113Problem Description给定平面上若干矩形,求出被这些矩形覆盖原创 2017-08-30 13:59:55 · 305 阅读 · 0 评论 -
HDU - 6315 - Naive Operations(线段树区间更新 + 单点更新)
HDU - 6315 - Naive Operations 题意:有两个数列a,b,均有n个数,b是1~n的一个排列,a均为0有两个操作:add l r:a数组 [l, r] 区间内的数+1query l r:求∑⌊ai/bi⌋ (l <= i <= r) 一共维护区间最大值,区间最小值,区间和三个数据当+1时,先区间更新记a区间最大值为 mx ...原创 2018-07-26 19:42:19 · 182 阅读 · 0 评论