猿的进化

hdu5977 Garden of EdenTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 614 Accepted Submission(s): 188Problem Description When God made

题目链接 Tree Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 22430 Accepted: 7403 DescriptionGive a tree with n vertices,each edge has a length(positive integer less than 1001).

Joint StacksTime Limit: 8000/4000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 673    Accepted Submission(s): 321Problem DescriptionA stack is

#include #include #include using namespace std;struct node{ int date; node *next;};node *ni(node *head)///逆序{ node *pre,*temp,*l,*now; l=head->next; pre=(node*)malloc(sizeo

#include #include #include using namespace std;struct node{ int date; node *next;};node *insert_(int k,node *head){ node * temp=(node *)malloc(sizeof(node)); temp->date=k;

#include #include #include using namespace std;struct node{ int date; node *next;};node* delou(node * head){ node *pre,*l; pre=head; l=head->next; while(l!=NULL) {

#include #include #include using namespace std;struct node{ int date; node *next;};void shou(node *head){ node *l; l=head->next; while(l!=NULL) {

#include #include #include using namespace std;struct ac{ int date; struct ac *next;};void sort1(struct ac *head,int T)//其实 就是冒泡{ ac *tmp,*p,*q; ac *a,*b; p=head;//把链首给p

#include #include #include using namespace std;struct node{ int date; node *next;};int main(){ node *head,*L,*p; int n; cin>>n; int x; for(int i=1;i<=n;i++) {

版权声明：本文为博主原创文章，未经博主允许不得转载。目录(?)[-]概述1插入排序直接插入排序Straight Insertion Sort 2 插入排序希尔排序Shells Sort3 选择排序简单选择排序Simple Selection Sort4 选择排序堆排序Heap Sort5 交换排序冒泡排序Bubble Sort6 交换排序快速排序Quick Sort7