【HDOJ】1497 Simple Library Management System

链表。

 #include <cstdio>
 #include <cstring>
 #include <cstdlib>
 
 #define MAXM 1001
 #define MAXN 100001
 
 int un[MAXM], ub[MAXM];
 int v[MAXN];
 int next[MAXN];
 
 int comp(const void *a, const void *b) {
     return *(int *)a - *(int *)b;
 }
 
 int main() {
     int m, n, t;
     int i, j, k;
     int ui, bi;
     int bid[];
     char cmd[];
 
 #ifndef ONLINE_JUDGE
     freopen("data.in", "r", stdin);
 #endif
 
     while (scanf("%d %d", &m, &n) != EOF) {
         scanf("%d", &t);
         memset(un, , sizeof(un));
         memset(ub, , sizeof(ub));
         memset(v, , sizeof(v));
         while (t--) {
             scanf("%s", cmd);
             if (cmd[] == 'B') {
                 // borrow ui bi
                 scanf("%d %d", &ui, &bi);
                 if (v[bi]) {
                     printf("The book is not in the library now\n");
                 } else if (un[ui] == ) {
                     printf("You are not allowed to borrow any more\n");
                 } else {
                     v[bi] = ui;
                     next[bi] = ub[ui];
                     ub[ui] = bi;
                     un[ui]++;
                     printf("Borrow success\n");
                 }
             }
             if (cmd[] == 'R') {
                 // return bi
                 scanf("%d", &bi);
                 if (v[bi] == ) {
                     printf("The book is already in the library\n");
                 } else {
                     ui = v[bi];
                     i = ;
                     j = ub[ui];
                     if (j == bi) {
                         ub[ui] = next[j];
                     } else {
                         while (i<un[ui] && bi!=next[j]) {
                             j = next[j];
                             ++i;
                         }
                         next[j] = next[bi];
                     }
                     un[ui]--;
                     v[bi] = ;
                     printf("Return success\n");
                 }
             }
             if (cmd[] == 'Q') {
                 // query ui
                 scanf("%d", &ui);
                 if (un[ui]) {
                     i = ;
                     j = ub[ui];
                     while (i < un[ui]) {
                         bid[i++] = j;
                         j = next[j];
                     }
                     qsort(bid, un[ui], sizeof(int), comp);
                     for (i=; i<un[ui]-; ++i)
                         printf("%d ", bid[i]);
                     printf("%d\n", bid[i]);
                 } else {
                     printf("Empty\n");
                 }
             }
         }
         printf("\n");
     }
 
     return ;
 }