백준 10709번 기상캐스터

문제 링크입니다: https://www.acmicpc.net/problem/10709

vector와 string을 연습하기 좋은 문제였습니다.

#include <iostream>

#include <vector>

#include <string>

using namespace std;

 

const int MAX = 100;

 

int result[MAX][MAX];

 

int main(void)

{

        ios_base::sync_with_stdio(0);

        cin.tie(0);

        int H, W;

        cin >> H >> W;

 

        vector<string> v(H);

        for (int i = 0; i < H; i++)

        {

                 cin >> v[i];

 

                 for (int j = 0; j < v[i].size(); j++)

                         if (v[i][j] == '.')

                         {

                                 int move = 0;

                                 for (int k = j; k >= 0; k--)

                                 {

                                          if (v[i][k] == 'c')

                                          {

                                                  result[i][j] = move;

                                                  break;

                                          }

                                          move++;

                                 }

                                 //구름이 올 수 없는 곳이라면 -1

                                 if (!result[i][j])

                                          result[i][j] = -1;

                         }

        }

 

        for (int i = 0; i < H; i++)

        {

                 for (int j = 0; j < W; j++)

                         cout << result[i][j] << " ";

                 cout << "\n";

        }

        return 0;

}

개발환경:Visual Studio 2017

지적, 조언, 질문 환영입니다! 댓글 남겨주세요~