pat 1113. Integer Set Partition (25)
https://www.patest.cn/contests/pat-a-practise/1113
#include
#include
using namespace std;
int a[100001],k,n;
void quicksort(int l,int r) {
swap(a[l], a[(l + r) / 2]);
if (l > r) return;
i
原创
2017-02-18 21:48:51 ·
214 阅读 ·
0 评论