__树__
文章平均质量分 84
zsc09_leaf
add oil
展开
-
hdu 1754 -- I Hate It (线段树)
<br /> <br /> <br /> <br />I Hate It<br /> <br />Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)<br />Total Submission(s): 7941 Accepted Submission(s): 2808<br /><br /><br />Problem Description<br />很多学校流行一种比较的习惯。老师们很原创 2011-03-14 17:58:00 · 583 阅读 · 0 评论 -
poj 3264 --Balanced Lineup (RMQ或线段树)
Balanced Lineup Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 20172 Accepted: 9369 Case Time Limit: 2000MS Description For the daily milking, Farm转载 2011-10-31 22:17:41 · 664 阅读 · 0 评论 -
hdu 2444-The Accomodation of Students(二分匹配)
The Accomodation of Students Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 609原创 2011-08-28 23:43:12 · 1710 阅读 · 0 评论 -
poj -- 2886 约瑟夫问题(线段树)
<br />http://poj.org/problem?id=2886<br /> <br /> <br /> <br />Who Gets the Most Candies?Time Limit: 5000MS Memory Limit: 131072K<br />Total Submissions: 4140 Accepted: 1117<br />Case Time Limit: 2000MS<br /><br /><br />Description<br /><br />N children原创 2011-04-29 09:33:00 · 1317 阅读 · 0 评论 -
poj -- 3277City Horizon (线段树)
<br />City HorizonTime Limit: 2000MS Memory Limit: 65536K<br />Total Submissions: 11351 Accepted: 3026<br /><br /><br />Description<br /><br />Farmer John has taken his cows on a trip to the city! As the sun sets, the cows gaze at the city horizon and ob原创 2011-04-24 17:01:00 · 807 阅读 · 0 评论 -
poj 1195 -- Mobile phones(2维树状数组)
<br />Mobile phonesTime Limit: 5000MS Memory Limit: 65536K<br />Total Submissions: 8215 Accepted: 3596<br /><br /><br />Description<br />Suppose that the fourth generation mobile phone base stations in the Tampere area operate as follows. The area is div原创 2011-04-24 16:49:00 · 734 阅读 · 0 评论 -
poj 3368 --Frequent values 线段树
<br />Frequent valuesTime Limit: 2000MS Memory Limit: 65536K<br />Total Submissions: 7364 Accepted: 2636<br /><br /><br />Description<br /><br />You are given a sequence of n integers a1 , a2 , ... , an in non-decreasing order. In addition to that, you a原创 2011-04-23 09:49:00 · 1393 阅读 · 0 评论 -
poj -- 2689 Prime Distance(筛选法求素数)
<br />Prime DistanceTime Limit: 1000MS Memory Limit: 65536K<br />Total Submissions: 5188 Accepted: 1384<br /><br /><br />Description<br />The branch of mathematics called number theory is about properties of numbers. One of the areas that has captured th原创 2011-04-25 19:04:00 · 1198 阅读 · 2 评论 -
poj -- 2155 Matrix (二维树状数组)
MatrixTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 9076 Accepted: 3411DescriptionGiven an N*N matrix A, whose elements are either 0 or 1. A[i, j] means the number in the i-th row and j-th column. Initially we have A[i, j] = 0 (1 We can chang原创 2011-04-23 18:04:00 · 796 阅读 · 0 评论 -
Zju -- 2859 Matrix Searching(线段树)
Matrix SearchingTime Limit: 10 Seconds Memory Limit: 32768 KB Given an n*n matrix A, whose entries Ai,j are integer numbers ( 1 Input The first line of the input contains a single integer T , the number of test cases. For each test case, the first原创 2011-04-23 13:40:00 · 878 阅读 · 0 评论 -
pku -- 3468 A Simple Problem with Integers(线段树)
题目连接:http://poj.org/problem?id=3468 Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 17698 Accepted: 4581 Case Time Limit: 2000MS Description You have N integers, A1, A2原创 2011-03-10 22:36:00 · 921 阅读 · 0 评论