hdu 1181 深搜

中文题

深搜

许久没写鸟,卡在输入问题上...

 #include <iostream>
 #include <string>
 using namespace std;
 bool flg;
 int n;
 char str[][];
 bool used[];
 void dfs(int p)
 {
     int i;
     if (p >=n || flg) return;
     if (str[p][] == 'm')
     {
         flg = true;
         return;
     }
     for (i=; i<n; i++)
         if (!used[i] && str[i][] == str[p][])
         {
             used[i] = true;
             dfs(i);
             used[i] = false;

         }
 }
 int main()
 {

     int i;
     string tmp;//="12345";
     //cout<<tmp.back()<<endl;
     while (cin>>tmp && tmp[] != '')
     {
         i=;
         flg = false;
         memset(used, false, sizeof(used));
         str[i][] = tmp[];
         str[i++][] = tmp[tmp.length()-];
         while (cin>>tmp && tmp[] != '')
         {
             str[i][] = tmp[];
             str[i++][] = tmp[tmp.length()-];
         }
         n = i;
         for (i=; i<n; i++)
             if (!flg && str[i][] == 'b')
             {
                 used[i] = true;
                 dfs(i);
                 used[i] = false;
             }
             if (flg)
                 cout<<"Yes."<<endl;
             else cout<<"No."<<endl;
     }
 }