- 博客(17)
- 资源 (4)
- 收藏
- 关注
RSS订阅原创 HLG 1053 Warcraft III（背包DP）
Warcraft IIITime Limit: 10000 MSMemory Limit: 65536 KTotal Submit: 458(136 users)Total Accepted: 181(120 users)Rating:Special Judge: NoDescripti
2014-09-28 15:01:11
726
原创 HLG 1038 菜鸟和大牛（数塔问题 简单DP）
菜鸟和大牛点击打开题目链接Time Limit: 1000 MSMemory Limit: 65536 KTotal Submit: 485(220 users)Total Accepted: 239(204 users)Rating:Special Judge: NoDescripti
2014-09-28 14:37:55
972
原创 HLG 1004 The Triangle（数塔问题DP）
The Triangle点击打开题目链接Time Limit: 1000 MSMemory Limit: 65536 KTotal Submit: 571(236 users)Total Accepted: 287(221 users)Rating:Special Judge: NoDe
2014-09-28 14:02:40
673
转载 树链剖分（转载）
树链剖分(2011-12-23 19:51:56)转载▼标签：树链剖分分类：各种算法 “在一棵树上进行路径的修改、求极值、求和”乍一看只要线段树就能轻松解决，实际上，仅凭线段树是不能搞定它的。我们需要用到一种貌似高级的复杂算法——树链剖分。 树链，就是树上的路径。剖分，就是把路径分类为重链和轻链。 记siz
2014-09-27 17:22:24
634
原创 poj 3368（RMQ）Frequent values
Frequent values点击打开题目链接Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 13414 Accepted: 4936DescriptionYou are given a sequence of n integers a1 , a2
2014-09-26 09:42:54
729
转载 RMQ and LCA
原帖地址：http://www.topcoder.com/tc?module=Static&d1=tutorials&d2=lowestCommonAncestor#Range_Minimum_Query_%28RMQ%29RMQ(Range Minimal Query)问题 给定一个数组A[1..N]，RMQ(A,i,j)就是A[i..j]的最小值的下标。
2014-09-23 18:34:26
6567
原创 poj 2709 Painter（贪心）
PainterTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3186 Accepted: 1983DescriptionThe local toy store sells small fingerpainting kits with between thre
2014-09-22 21:03:09
680
原创 poj 3122&&hdu1969 Pie(二分)
#include #include #include #include #define N 10010#define pi acos(-1)using namespace std;int a[N];double v[N];int main(){ int t,n,f,i; while(~scanf("%d",&t)) {
2014-09-22 19:18:26
643
原创 HDU 5017 Ellipsoid（退火模拟）
EllipsoidTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 658 Accepted Submission(s): 196Special JudgeProblem DescriptionGiven a 3
2014-09-17 13:42:30
1003
1
原创 HDU 大菲波数（大数复习）
大菲波数Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11589 Accepted Submission(s): 3939点击打开题目链接Problem DescriptionFibonacci数列，定义如下
2014-09-15 13:37:50
1160
原创 poj 2240 Arbitrage（最短路径）
Arbitrage点击打开题目链接Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15931 Accepted: 6706DescriptionArbitrage is the use of discrepancies in currency exch
2014-09-11 15:02:53
812
原创 Bestcoder#8 && HDU4990 Reading comprehension（规律）
Reading comprehensionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 340 Accepted Submission(s): 164Problem DescriptionRead the p
2014-09-09 13:16:02
636
原创 poj 1789Truck History(最小生成树 prime)
Truck History点击打开题目链接Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 18736 Accepted: 7234DescriptionAdvanced Cargo Movement, Ltd. uses trucks of diffe
2014-09-03 13:30:57
549
原创 poj 1861 Network（最小生成树）
NetworkTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 13680 Accepted: 5310 Special JudgeDescriptionAndrew is working as system administrator and
2014-09-01 21:11:35
523
自然辩证法课程论文-浅谈人工智能伦理.docx
2020-07-06
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人