摘要: http://acm.hdu.edu.cn/showproblem.php?pid=2673View Code 1 #include<stdio.h> 2 #include<stdlib.h> 3 int cmp(const void *a, const void *b) 4 { 5 return *(int*)a - *(int*)b ; 6 } 7 int main() 8 { 9 int n, i, j, a[10010];10 while(scanf("%d", &n)!=EOF)11 {12 for(i=0; i<n; i++ 阅读全文
posted @ 2013-01-28 19:51 yelan@yelan 阅读(419) 评论(0) 推荐(0) 编辑
摘要: http://acm.hdu.edu.cn/showproblem.php?pid=1040View Code 1 #include<stdio.h> 2 int r[10000] ; 3 int QuickSort1 (int r[], int low, int high) 4 { 5 int key; 6 key=r[low]; 7 while(low<high) 8 { 9 10 while(low<high && r[high]>=key) high--;11 r[low]=r[high];12 ... 阅读全文
posted @ 2013-01-28 18:52 yelan@yelan 阅读(425) 评论(0) 推荐(0) 编辑
摘要: http://www.cnblogs.com/morewindows/category/314533.html 阅读全文
posted @ 2013-01-28 18:32 yelan@yelan 阅读(127) 评论(0) 推荐(0) 编辑