- 博客(15)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 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
1331
原创 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
1210
2
原创 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
820
原创 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
753
原创 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
816
原创 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
888
原创 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
1410
转载 ACM计算几何题目推荐
下面的OJ之中，CII是指ACM-ICPC Live Archive ，网址是：http://cii-judge.baylor.edu/其他OJ的地址大家都熟知了，因此不再提供。一。基础题目1.1 有固定算法的题目A， 最近点对问题最近点对问题的算法基于扫描线算法。ZOJ 2107 Quoit Design 典型最近点对问题POJ 3714 Raid 变种最近点对问题B，最小包围圆最小包围圆的算法是一种增量算法，期望是O(n)。ZOJ 1450 Minimal
2011-04-18 18:22:00
15502
1
原创 poj -- 3692 Kindergarten (最大完全子图)
<br /> <br />KindergartenTime Limit: 2000MS Memory Limit: 65536K<br />Total Submissions: 2819 Accepted: 1292<br /><br /><br />Description<br /><br />In a kindergarten, there are a lot of kids. All girls of the kids know each other and all boys also know
2011-04-14 22:49:00
4109
原创 poj -- 2287 Tian Ji -- The Horse Racing(田忌赛马，递归分治)
Tian Ji -- The Horse RacingTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 7104 Accepted: 2178DescriptionHere is a famous story in Chinese history. That was about 2300 years ago. General Tian Ji was a high official in the country Qi. He likes t
2011-04-13 20:35:00
2406
转载 zt程序员文史综合题目，传说中理科生看到会沉默，文科生看
<br /><br />标 题: zt程序员文史综合题目，传说中理科生看到会沉默，文科生看 <br />发信站: 逸仙时空 Yat-Sen Channel (Fri Apr 8 19:49:04 2011)<br /><br />(看完我表示压力很大）<br />程序员文史综合题目<br />一，选择题（皆为单选）： <br />1，以下谁是二进制思想的最早提出者？ <br />a，伏羲；b，姬昌；c，莱布尼茨；d，柏拉图。 <br />2，以下哪个概念和公孙龙的《指物论》中的“指”字含义相近？ <b
2011-04-10 18:14:00
1076
转载 STL -- 堆
<br />C ++ STL 中与heap 有关的操作有 如下几个 :<br /><br /><br />make_heap(), <br /><br />pop_heap(),<br /><br />push_heap(), <br /><br />sort_heap(), <br /><br />is_heap();<br /> <br />is_heap() :<br /><br /> 注：visual studio的STL实现中没有该函数。<br /><br />原型如下 :<br /><br
2011-04-10 16:49:00
767
原创 poj -- 2833 The Average(优先队列或堆或直接模拟)
http://poj.org/problem?id=2833 The AverageTime Limit: 6000MS Memory Limit: 10000KTotal Submissions: 7443 Accepted: 2288Case Time Limit: 4000MSDescriptionIn a speech contest, when
2011-04-10 16:49:00
1280
2
原创 poj -- 1426 Find The Multiple (搜索)
题目连接：http://poj.org/problem?id=1426Find The MultipleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8420 Accepted: 3443 Special JudgeDescriptionGiven a positive integer n, write a program to find out a nonzero multiple m of n whose decimal rep
2011-04-07 16:47:00
1374
原创 poj 1730 -- Perfect Pth Powers
<br />http://poj.org/problem?id=1730<br /> <br />Perfect Pth PowersTime Limit: 1000MS Memory Limit: 10000K<br />Total Submissions: 11102 Accepted: 2475<br /><br /><br />Description<br />We say that x is a perfect square if, for some integer b, x = b2. Si
2011-04-01 20:50:00
933
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人