- 博客(16)
- 收藏
- 关注
RSS订阅原创 【并查集专题】【HDU】
How Many TablesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14542 Accepted Submission(s): 7132Problem DescriptionToday is
2014-11-29 18:34:09
3686
1
原创 【计算几何初步-线段相交+并查集】【HDU1558】Segment set
Segment setTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3548 Accepted Submission(s): 1324Problem DescriptionA segment and
2014-11-29 08:00:54
567
原创 【计算几何初步-代码好看了点线段相交】【HDU2150】Pipe
题目没什么 只是线段相交稍微写的好看了点PipeTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1252 Accepted Submission(s): 481Problem Descripti
2014-11-29 07:54:36
990
原创 【计算几何初步-凸包-Graham扫描法-极角序】【HDU1348】 WALL
WallTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3779 Accepted Submission(s): 1066Problem DescriptionOnce upon a time ther
2014-11-28 00:32:23
1480
原创 【计算几何初步-凸包-Jarvis步进法。】【HDU1392】Surround the Trees
【科普】什么是BestCoder？如何参加？Surround the TreesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8113 Accepted Submission(s): 3095
2014-11-27 17:51:32
4055
2
原创 【计算几何初步-判断是否凸多边形】【HDU2108】Shape of HDU
Shape of HDUTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5369 Accepted Submission(s): 2445Problem Description话说上回讲到海东集团推选老
2014-11-25 22:28:04
1171
原创 【计算几何初步：多边形中心】【HDU1115】Lifting the Stone
一.质点系重心公式x=(x1*m1+x2*m2+x3*m3.....xn*mn)/M (M=m1+m2+m3+m4...+mn)二.三角形重心可直接求得，但在多边形剖分中 各三角形的质点的质量大小不一样 质量大小等于三角形面积.三.多边形重心三角形剖分+任意点的三角形剖分+三角形重心+质点系重心公式+任意点的三角形剖分所以很容易知道一种很优美的计算公式(看代码)#in
2014-11-25 19:46:11
1326
原创 【计算几何初步-线段相交】【HDU1089】线段交点
You can Solve a Geometry Problem tooTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7847 Accepted Submission(s): 3834Problem Desc
2014-11-25 16:38:30
623
原创 【数位DP】【HDU2089】不要62
不要62Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20634 Accepted Submission(s): 7063Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62（音：
2014-11-12 14:26:33
652
原创 【二分图最大匹配】【HDU2063】过山车
【科普】什么是BestCoder？如何参加？过山车Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11648 Accepted Submission(s): 5119Problem De
2014-11-11 21:36:30
509
原创 【特殊的图+DP】【11月校赛】大家一起玩游戏
大家一起玩游戏Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 26 Accepted Submission(s) : 2Font: Times New Roman | Verdana | GeorgiaFon
2014-11-11 12:00:59
631
原创 【考虑周全+数学变形】【11月赛】Is it a fantastic matrix?
Is it a fantastic matrix?Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 5 Accepted Submission(s) : 2Problem DescriptionGiven an
2014-11-10 13:37:36
645
原创 【进制问题】【HDU2056】A + B Again
A + B AgainTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15772 Accepted Submission(s): 6847Problem DescriptionThere must be
2014-11-07 21:34:27
1980
原创 【巧妙消维DP】【HDU2059】龟兔赛跑
龟兔赛跑Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11647 Accepted Submission(s): 4382Problem Description据说在很久很久以前，可怜的兔子经历了人生
2014-11-07 20:43:07
601
原创 【N^2迪杰斯特拉】
void finddist(int &s){ int ans=2000000000; for(int i=1;i<=N;i++) if(visit[i]==0) { if(dist[i]<ans) { ans=dist[i]; s=i; } } visit[s]=1;}void Dijkstra(int s){ dist[s]=0; for(int
2014-11-07 16:20:20
627
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人