시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
10 초 (추가 시간 없음) | 1024 MB | 150 | 121 | 107 | 80.451% |
Li has planned a bike tour through the mountains of Switzerland. His tour consists of N checkpoints, numbered from 1 to N in the order he will visit them. The i-th checkpoint has a height of Hi.
A checkpoint is a peak if:
Please help Li find out the number of peaks.
The first line of the input gives the number of test cases, T. T test cases follow. Each test case begins with a line containing the integer N. The second line contains N integers. The i-th integer is Hi.
For each test case, output one line containing Case #x: y
, where x
is the test case number (starting from 1) and y
is the number of peaks in Li's bike tour.
4 3 10 20 14 4 7 7 7 7 5 10 90 20 90 10 3 10 3 10
Case #1: 1 Case #2: 0 Case #3: 2 Case #4: 0
Contest > Google > Kick Start > Google Kick Start 2020 > Round B A번