Submission #1728447

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define imfor(i, n) for(int i = 0; i < n; i++)
using namespace std;
ll MOD = 1000000007;

int main() {
    int n;
    cin >> n;
    int prev;
    bool up = true;
    int ans = 0;
    int tmp = 1;
    imfor(i, n) {
        int h;
        cin >> h;
        if (i != 0) {
            if (up && prev < h) {
                tmp++;
            }
            else if (up && prev > h) {
                up = false;
                tmp++;
            }
            else if (!up && prev > h) {
                tmp++;
            }
            else {
                up = true;
                tmp = 2;
            }
        }
        prev = h;
        ans = max(ans, tmp);
    }
    cout << ans << endl;
}

Submission Info

Judge Result