【題解】Google Kick Start 2020 Round D – p1. Record Breaker

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

int t, n, a[200005], mx, ans;

int main(){
    cin >> t;
    for (int Case = 1; Case <= t; Case++){
        cin >> n;
        ans = 0;
        for (int i = 0; i < n; i++){
            cin >> a[i];
        }
        mx = a[0];
        if (a[0] > a[1]) ans++;
        for (int i = 1; i < n-1; i++){
            if (a[i] > mx && a[i] > a[i+1]) ans++;
            mx = max(mx, a[i]);
        }
        if (a[n-1] > mx) ans++;
        if (n == 1) ans = 1;
        cout << "Case #" << Case << ": " << ans << "\n";
    }
}