[#92][알고리즘][SW Expert Academy] 1206. S/W 문제해결 기본 1일차 - View
[SW Expert Academy] 1206. S/W 문제해결 기본 1일차 - View
문제 링크 (https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV134DPqAA8CFAYh)
C++풀이
#include <iostream>
using namespace std;
int main() {
int testCase, *arr, answer;
for (int i = 1; i <= 10; i++) {
cin >> testCase;
arr = new int[testCase];
answer = 0;
//배열 입력받기
for (int j = 0; j < testCase; j++) {
cin >> arr[j];
}
//조망권
for (int k = 2; k < testCase - 2; k++) {
int tmp = arr[k];
while (tmp--) {
if (tmp >= arr[k - 1] && tmp >= arr[k + 1]
&& tmp >= arr[k - 2] && tmp >= arr[k + 2]) {
answer++;
}
else {
break;
}
}
}
cout << "#" << i << " " << answer << endl;
}
return 0;
}
| cs |
댓글
댓글 쓰기