九度oj题目1181：遍历链表

 1 #include <cstdio>
 2 #include <cstring>
 3 #include <string>
 4 #include <queue>
 5 #include <stack>
 6 #include <iostream>
 7 using namespace std;
 8 struct node{
 9     int v;
10     node *next;
11 };
12 int main(){
13     //freopen("D:\\INPUT.txt","r",stdin);
14     int n;
15     node *head;
16     while(scanf("%d",&n)!=EOF){
17         head=new node();
18         //head->v=
19         head->next=NULL;
20         int i,num;
21         node *p,*q;
22         for(i=0;i<n;i++){
23             scanf("%d",&num);
24             q=head;
25             p=head->next;
26             while(p&&num>=p->v){
27                 q=p;
28                 p=p->next;
29             }
30             node *t=new node();
31             t->v=num;
32             q->next=t;
33             t->next=p;
34         }
35         p=head->next;
36         cout<<p->v;
37         p=p->next;
38         while(p){
39             cout<<" "<<p->v;
40             p=p->next;
41         }
42         cout<<endl;
43     }
44     return 0;
45 }