SGU 461 Wiki Lists dfs

不难的题，不过蛮有意思的dfs

 #include <iostream>
 #include <cstdio>
 #include <fstream>
 #include <algorithm>
 #include <cmath>
 #include <deque>
 #include <vector>
 #include <queue>
 #include <string>
 #include <cstring>
 #include <map>
 #include <stack>
 #include <set>
 #define LL long long
 #define eps 1e-8
 #define INF 0x3f3f3f3f
 //#define OPEN_FILE
 using namespace std;
 const char step[][][] = { "<ul>", "</ul>", "<ol>", "</ol>", "<li>", "</li>" };
 char s[][];
 int m;

 void display(char ch, int f, int pos){
     if (pos !=  && !f){
         printf("%s\n", step[][]);
     }
     if (ch == '*'){
         if (f){
             printf("%s\n", step[][]);
         }
         else{
             printf("%s\n", step[][]);
         }
     }
     else{
         if (f){
             printf("%s\n", step[][]);
         }
         else{
             printf("%s\n", step[][]);
         }
     }
     if (pos !=  && f){
         printf("%s\n", step[][]);
     }
 }
 void dfs(int p, int q, int pos){
     while (p <= q){
         if (s[p][pos] != '#' && s[p][pos] != '*'){
             if (pos == ){
                 printf("%s\n", s[p]);
             }
             else{
                 printf("%s\n%s\n%s\n", step[][], s[p] + pos, step[][]);
             }
             p++;
             continue;
         }
         int i;
         bool flag = false;
         for (i = p + ; i <= q; i++){
             if (s[i][pos] == s[p][pos]){
                 flag = true;
             }
             else{
                 break;
             }
         }
         i--;
         if (flag == true){
             display(s[p][pos], , pos);
             dfs(p, i, pos + );
             display(s[p][pos], , pos);
             p = i + ;
         }
         else{
             if (pos == ){
                 printf("%s\n", s[p]);
             }
             else{
                 printf("%s\n%s\n%s\n", step[][], s[p] + pos, step[][]);
             }
             p++;
         }
     }
 }
 int main()
 {
 #ifdef OPEN_FILE
     freopen("in.txt", "r", stdin);
     //freopen("out.txt", "w", stdout);
 #endif // OPEN_FILE
     m = ;
     while (~scanf("%s", s[m])){
         m++;
     }
     m--;
     dfs(, m, );
     //printf("%d\n", m);
 }