减治分治变治
algzjh
这个作者很懒,什么都没留下…
展开
-
COJ-1867-John and Health rate
1867: John and Health rateSubmit Page Summary Time Limit: 2 Sec Memory Limit: 128 Mb Submitted: 367 Solved: 85 Description The cold and flu season is here.John is worried about his原创 2017-05-14 18:44:39 · 409 阅读 · 0 评论 -
用分治法解决最近点对问题
算法实验://最接近点对#include<iostream>#include<cstdlib>#include<fstream>#include<algorithm>#include<iomanip>#include<map>#include<cmath>#include<ctime>using namespace std ;const int MAXN=1e6+10;cons原创 2017-05-29 17:42:37 · 1421 阅读 · 0 评论 -
HDU1007-Quoit Design&POJ3714-Raid(最近点对问题)
Quoit DesignTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 53084 Accepted Submission(s): 13992Problem Description Have you ever played qu原创 2017-05-29 18:43:42 · 545 阅读 · 0 评论 -
递归与分治
递归 1、排列问题 2、整数划分问题 3、Hanoi塔问题分治 1、二分搜索 2、大整数乘法 3、Strassen矩阵乘法 4、棋盘覆盖 5、归并排序(递归、非递归) 6、快速排序 7、线性时间选择 8、最近点对问题 9、循环赛日程表原创 2017-06-18 16:49:59 · 315 阅读 · 0 评论 -
棋盘覆盖问题(分治)
#include<iostream>#include<string>#include<cstdio>#include<algorithm>#include<cstring>using namespace std;const int MAXN=105;int cnt;int mat[MAXN][MAXN];void chessBoard(int tr,int tc,int dr,int原创 2017-06-20 11:14:23 · 524 阅读 · 0 评论 -
HDU6040-Hints of sd0061
Hints of sd0061Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1861 Accepted Submission(s): 548Problem Description sd0061, the legend of原创 2017-07-28 13:09:06 · 530 阅读 · 0 评论 -
归并排序求逆序数
示例题目: POJ1804BrainmanTime Limit: 1000MS Memory Limit: 30000K Total Submissions: 10945 Accepted: 5645 DescriptionBackground Raymond Babbitt drives his brother Charlie mad. Recently Raymo原创 2017-08-31 17:02:30 · 382 阅读 · 0 评论