uva oj 10010---where's waldorf

本题链接
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=951


作为一个码渣。。真的花了很多时间在这道题上，总结一下经验教训。 

1. 一定要搞明白output的格式，不然就算逻辑对也不能AC。

2. 看清题意。 题目要求在grid中找到最优先的一个字符串，就是因为忽略了这一点才浪费了很多时间。




#include <iostream>
#include <cctype>
#include <string>

using namespace std;

int length_,width_;

typedef string::iterator Itr;

const bool Check(char** grid, string& str, int w, int l, int w_incre, int l_incre)
{
    int strl = str.length();
    int index = 0;
    char temp;
    char temp2;

    while(w >= 0 && l >= 0 && w < width_  && l < length_ && index < strl)
    {
      temp = str[index];
      temp2 = grid[l][w];

      w += w_incre;
      l += l_incre;

      index++;

      if(temp2 != temp)
        return false;
    }
    if(index == strl)
      return true;
    else 
      return false;
}

int main()
{
    char** grid;

    int round;

    int wordnum; 

    cin >> round;

    while(round--)
    {
      cin >> length_ >> width_;

      grid = new char*[length_];
      for(int i = 0; i < length_; i++)
        grid[i] = new char[width_ + 1];

      for(int i = 0; i < length_; i++)
        cin >> grid[i];

      for(int i = 0; i < length_; i++)
        for(int j = 0; j <= width_; j++)
          grid[i][j] = tolower(grid[i][j]);

      cin >> wordnum;

      string word; 


      while(wordnum--)
      {
         cin >> word;

         for(int i = 0; i < word.length(); i++)
           word[i] = tolower(word[i]);


         bool findchar = false;
            for(int l = 0; l < length_ && !findchar; l++)
            {
              for(int w = 0; w < width_ && !findchar; w++)
              {
                if(word[0] == grid[l][w])
                {

                  if(Check(grid, word, w, l, 1, 0) ||
                     Check(grid, word, w, l, -1, 0) ||
                     Check(grid, word, w, l, 0, 1) ||
                     Check(grid, word, w, l, 0, -1) ||
                     Check(grid, word, w, l, 1, 1) ||
                     Check(grid, word, w, l, -1, -1) ||
                     Check(grid, word, w, l, 1, -1) || 
                     Check(grid, word, w, l, -1, 1))
                  {
                    cout << l + 1 << " " << w + 1 << endl;
                    findchar = true;
                  }

                }

              }
            }
      }
      for(int i = 0; i < length_; i++)
        delete [] grid[i];
      delete [] grid;

      if(round)
        cout << endl;
    }
    return 0;
}