数据结构
文章平均质量分 77
xieshimao
topcoder
展开
-
POJ 3264 线段树
Balanced LineupTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 16163 Accepted: 7468Case Time Limit: 2000MSDescriptionFor the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides to org原创 2011-03-11 22:34:00 · 3448 阅读 · 0 评论 -
leetcode 85. Maximal Rectangle 最大矩形
Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area.Example:Input:[ ["1","0","1","0","0"], ["1","0","1&quo原创 2018-09-29 12:44:21 · 280 阅读 · 0 评论 -
leetcode 84. Largest Rectangle in Histogram 柱状图中最大的矩形
Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.Above is a histogram where width of each ...原创 2018-09-29 11:06:11 · 357 阅读 · 0 评论 -
131. The Skyline Problem 矩形并问题
描述水平面上有 N 座大楼,每座大楼都是矩阵的形状,可以用一个三元组表示 (start, end, height),分别代表其在x轴上的起点,终点和高度。大楼之间从远处看可能会重叠,求出 N 座大楼的外轮廓线。外轮廓线的表示方法为若干三元组,每个三元组包含三个数字 (start, end, height),代表这段轮廓的起始位置,终止位置和高度。请注意合并同样高度的相邻轮廓,不同的...原创 2018-09-06 17:30:53 · 429 阅读 · 0 评论 -
SWUSTOJ2475 字典树
swustoj2475,字典树原创 2016-09-20 11:45:46 · 1222 阅读 · 0 评论 -
Codeforces Round #179 (Div. 2) C Greg and Array
C. Greg and Arraytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGreg has an array a = a1, a2, ..., an and原创 2013-04-12 06:50:28 · 2453 阅读 · 0 评论 -
POJ 3368 线段树,给定区间求连续不降序列的在该区间内出现最多的数
Frequent valuesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 13771 Accepted: 5045DescriptionYou are given a sequence of n integers a1 , a2 , ... , an原创 2014-12-04 15:22:41 · 2606 阅读 · 0 评论 -
HDU 1698 线段树成段更新 Just a Hook
Just a HookTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8016 Accepted Submission(s): 3883Problem DescriptionIn the game of Dot原创 2012-06-04 16:59:51 · 3451 阅读 · 0 评论 -
POJ 1207 HDOJ/HDU 1032 3n+1数链问题 绝对不水的解法
The 3n + 1 problemTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 39115 Accepted: 12294Descripti原创 2011-09-14 15:36:58 · 3033 阅读 · 4 评论 -
POJ 3468 线段树,OIer杨弋出的题目。。膜拜中。。。orz...
A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 17755 Accepted: 4605C原创 2011-03-12 20:38:00 · 2191 阅读 · 0 评论 -
HDU/HDOJ 1166 线段树
敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9453 Accepted Submission(原创 2011-09-12 21:14:47 · 1179 阅读 · 0 评论 -
POJ/PKU 2513 并查集+字典树+欧拉回路
Colored SticksTime Limit: 5000MS Memory Limit: 128000KTotal Submissions: 20750 Accepted: 5482Description原创 2011-08-10 01:00:12 · 1227 阅读 · 0 评论 -
UESTC ACM 1529 并查集+贪心
题目连接:http://acm.uestc.edu.cn/problem.php?pid=1529这个题我先开始就联想到以前做过的UVA上面的一道题目:求最大的最小边,但是那个题是利用floyd算法过的。面对这个题N=1000的挑战。所以floyd我试都没有试 后原创 2011-08-11 00:34:16 · 1799 阅读 · 0 评论 -
POJ 2001 字典树
<br />题目连接:http://poj.org/problem?id=2001<br />记录每个字母出现的次数就可以了~<br /> <br />Source CodeProblem:2001 User:bingshenMemory: 1220K Time: 32MSLanguage: C++ Result:AcceptedSource Code#include<stdio.h>#include<string.h>structnode{int num;int data[26];voidinit();}原创 2011-04-05 22:47:00 · 872 阅读 · 1 评论 -
POJ 2236 并查集
Wireless NetworkTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 9916 Accepted: 4185<br />DescriptionAn earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an原创 2011-03-28 15:51:00 · 5236 阅读 · 3 评论 -
LeetCode.924 尽量减少恶意软件的传播 Minimize Malware Spread(并查集)
在节点网络中,只有当 graph[i][j] = 1 时,每个节点 i 能够直接连接到另一个节点 j。一些节点 initial 最初被恶意软件感染。只要两个节点直接连接,且其中至少一个节点受到恶意软件的感染,那么两个节点都将被恶意软件感染。这种恶意软件的传播将继续,直到没有更多的节点可以被这种方式感染。假设 M(initial) 是在恶意软件停止传播之后,整个网络中感染恶意软件的最终节点数。...原创 2018-10-15 14:02:42 · 1904 阅读 · 0 评论