Google Kick Round-D Question (2020)

Isyana is given the number of visitors at her local theme park on N consecutive days. The number of visitors on the i-th day is VI. A day is record-breaking if it satisfies both of the following conditions:

1. The number of visitors on the day is strictly larger than the number of visitors on each of the previous days.
2. Either it is the last day, or the number of visitors on the day is strictly larger than the number of visitors on the following day.

Note that the very first day could be a record-breaking day. Please help Isyana find out the number of record-breaking days.

Input: 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 Vi.

Output: 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 record-breaking days.

Limits:

• Time limit: 20 seconds per test set.
• Memory limit: 1GB.

1 ≤ T ≤ 100.
0 ≤ Vi ≤ 2 × 105.
Test set 1
1 ≤ N ≤ 1000.
Test set 2
1 ≤ N ≤ 2 × 105 for at most 10 test cases.
For the remaining cases, 1 ≤ N ≤ 1000.

Input:

4
8
1 2 0 7 2 0 2 0
6
4 8 15 16 23 42
9
3 1 4 1 5 9 2 6 5
6
9 9 9 9 9 9

Output:

Case #1: 2
Case #2: 1
Case #3: 3
Case #4: 0

In Sample Case #1: The bold and underlined numbers in the following represent the record-breaking days: 1 2 0 7 2 0 2 0.

In Sample Case #2: only the last day is a record-breaking day.

In Sample Case #3: The first, the third, and the sixth days are record-breaking days.

In Sample Case #4: there is no record-breaking day.

Implementation:

C++

#include <bits/stdc++.h>
using namespace std;

int main()
{

    int t, t1 = 1;
    cin >> t;

    while (t--) {
        int n;
        cin >> n;

        vector<int> v(n);

        for (int i = 0; i < n; i++) {
            cin >> v[i];
        }

        vector<int> arrMax(n);
        arrMax[0] = v[0];

        for (int i = 1; i < n; i++) {
            arrMax[i] = max(arrMax[i - 1], v[i]);
        }

        int count = 0;

        for (int i = 1; i < n - 1; i++) {
            if (v[i] > arrMax[i - 1] && v[i] > v[i + 1]) {
                count++;
            }
        }

        if (n >= 1 && v[0] > v[1])
            count++;
        if (n >= 2 && v[n - 1] > arrMax[n - 2])
            count++;

        cout << "Case #" << t1++ << ": " << count << endl;
    }

    return 0;
}