碳酸钙的01妖精的博客

Quoit Design Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 64316    Accepted Submission(s): 17026   Problem Description ...

一、当n==2^k时，就要考虑到分治算法二、分治就是一种终下回的深搜结构

#include <iostream>#include <cstdio>using namespace std;#define MAXN 10000int a[MAXN][MAXN];void func(int start,int length){ int i,j; int len=length/2; if(len==1) {...

 利用分治算法的时间复杂度为O（nlogn）当n<-10^4时可直接冒泡排序找（更省时间）当n>10^4时 （利用分治找更省时间）#include <cstdio>#include <algorithm>#include <cmath>#include <iostream>using namespace std;#...