hdu1040 - As Easy As A+B
来源:互联网 发布:阮星竹 知乎 编辑:程序博客网 时间:2024/05/17 20:26
地址
http://acm.hdu.edu.cn/showproblem.php?pid=1040
定位
水题
排序
分析
- 最简单的排序,快排直接过。
代码
#include <stdio.h>#include <stdlib.h>void Qsort(int a[],int left,int right){ int i = left; int j = right; int key = a[left]; if(left >= right) { return; } while(i < j) { while(i < j && key <= a[j]) { j--; } a[i] = a[j]; while(i < j && key >= a[i]) { i++; } a[j] = a[i]; } a[i] = key; Qsort(a,left,i-1); Qsort(a,i+1,right);}int main(){ int T; int n,i; int src[1000]; scanf("%d*c",&T); while(T--) { memset(src,0,sizeof(src)); scanf("%d*c",&n); for(i=0;i<n;i++) { scanf("%d*c",&src[i]); } Qsort(src,0,n-1); for(i=0;i<n-1;i++) { printf("%d ",src[i]); } printf("%d\n",src[i]); }}
性能
总结
每行的最后一个元素后不应该输出空格,而应该输出换行符。因此,应对每组排序的最后元素特殊处理。
Thanks everyone
0 0
- hdu1040 As Easy As A+B
- hdu1040 As Easy As A+B
- HDU1040 As Easy As A+B
- hdu1040 As Easy As A+B
- hdu1040 - As Easy As A+B
- hdu1040 As Easy As A+B
- HDU1040 As Easy As A+B【排序】
- HDU1040 - As Easy As A+B (简单题)
- hdu1040 As Easy As A+B (排序)
- hdu1040 As Easy As A+B(堆排序)
- hdu1040 As Easy As A+B(C语言)
- ACM-简单题之As Easy As A+B——hdu1040
- As easy as A+B
- As Easy As A+B
- As Easy As A+B
- As Easy As A+B
- As Easy As A+B
- As Easy As A+B
- springmvc的@requestParams和@requestHeader
- 【算法】递归法实现栈的倒序
- 初识vim编辑器
- Rotate Array
- ANSI C中scanf()的转换说明符和scanf()的转换修饰符
- hdu1040 - As Easy As A+B
- 段描述符与段选择子的结构
- C语言编译全过程剖析
- 【算法】递归法实现汉诺塔问题
- 要做好SQA,建议自己看哪些书?
- ListView、AdapterView、RecyclerView全面解析
- linux下安装mysql数据库(3)
- 【算法】最大窗口
- 什么是Code Review 代码审查