排序(qsort、拓扑排序、冒泡
inlcude_cx
这个作者很懒,什么都没留下…
展开
-
HDU3177解题报告(qsort排序)
//唉,本来以为按照所需最大空间排序的,没想到提交之后错了,搜了一下才明白是按照二者之差排序的,二者的差相同时按照pi排序;这个题要按照装备容量和所需搬运容量之差排序,然后一个一个判定#include#includestruct hole{ int pi; int mi; int cha;}hole[1002];int cmp(const void *a,const void *原创 2012-12-05 17:05:32 · 378 阅读 · 0 评论 -
ZZULI 1619 (HDU 2647) Reward …
RewardTime Limit:1000MS Memory Limit:65536KTotal Submit:16 Accepted:2DescriptionDandelion's uncle is aboss of a factory. As the spring festival is coming , he wants todistribute rewards to his w原创 2012-12-05 17:15:15 · 334 阅读 · 0 评论 -
七种qsort排序方法
很全很实用原文地址:七种qsort排序方法作者:code_ghostfire_s注意:可以的话最好还是自己写qsort( )而不是调用stdlib.h里的qsort()函数,那样效率会高很多的七种qsort排序方法一、对int类型数组排序int num[100];Sample:int cmp ( const void *a , const void *b ){return *(in转载 2012-12-05 17:14:04 · 504 阅读 · 0 评论 -
冒泡排序
· #include· int main()· {· intn,a[109],i,j,k,b;· scanf("%d",&n);· for(i=0;i· scanf("%d",&a[i]);· for(j=0;j·原创 2012-12-05 17:05:27 · 356 阅读 · 0 评论 -
qsort()排序函数
n 排序是最常用的预处理技术n qsort包含在头文件中n 函数根据你给的比较条件进行快速排序n 排序之后的结果仍然放在原数组中n 使用qsort函数必须自己写一个比较函数。一、对整型数组排序Int main(){ inta[10]={4,2,7,3,6,1,5}; inti,n=7; qsort(a,n,sizeof(a[0]),cmp);原创 2012-12-05 17:05:29 · 689 阅读 · 0 评论 -
HDU 1078 FatMouse and Cheese(肥…
FatMouse and CheeseTime Limit: 2000/1000 MS(Java/Others) Memory Limit:65536/32768 K (Java/Others)Total Submission(s): 1928 Accepted Submission(s):726Problem DescriptionFatMouse has sto原创 2012-12-05 17:12:15 · 371 阅读 · 0 评论 -
HDU 1009 FatMouse' Trade(肥老鼠…
FatMouse' TradeTime Limit: 2000/1000 MS(Java/Others) Memory Limit:65536/32768 K (Java/Others)Total Submission(s): 17063 Accepted Submission(s):5207Problem DescriptionFatMouse prepared原创 2012-12-05 17:12:17 · 424 阅读 · 0 评论 -
HDU 1160 FatMouse's Speed(肥老…
FatMouse's SpeedTime Limit: 2000/1000 MS(Java/Others) Memory Limit:65536/32768 K (Java/Others)Total Submission(s): 3625 Accepted Submission(s):1530Special JudgeProblem DescriptionFatMo原创 2012-12-05 17:12:19 · 540 阅读 · 0 评论