优先队列
文章平均质量分 81
AledaLee
个人博客已经迁移到了https://sites.google.com/site/lishuo02wiki/,主要是一些技术的分享,有需要的可以访问。
展开
-
优先队列(UVAL-3135)
A data stream is a real-time, continuous, ordered sequence of items. Some examples include sensor data, Internet traffic, financial tickers, on-line auctions, and transaction logs such as Web usage lo原创 2013-05-16 20:43:05 · 949 阅读 · 1 评论 -
B(UVA-11997)k个最小和
Problem K K Smallest Sums You're given k arrays, each array has k integers. There are kk ways to pick exactly one element in each array and calculate the sum of the integers. Your task is to fin原创 2013-05-16 20:46:31 · 903 阅读 · 0 评论 -
B-开门人和关门人(优先队列)
开门人和关门人 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 8519 Accepted Submission(s): 4412 Problem Description 每天第一个到机房的人要把门打开,最后原创 2013-05-04 19:42:45 · 876 阅读 · 0 评论 -
Hdu-1180(诡异的楼梯)
C - 诡异的楼梯 Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Description Hogwarts正式开学以后,Harry发现在Hogwarts里,某些楼梯并不是静止不动的,相反,他们每隔一分钟就变动一次方向. 比如下面的例原创 2013-05-04 22:51:40 · 810 阅读 · 0 评论