60572023-10-29 02:27:18CZHSzomjas állatokcpp17Accepted 100/1003ms4800 KiB
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>

using ll = long long;
using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> allAnimal = {};
    for (int i = 0; i < n; i++)
    {
        int tmp;
        cin >> tmp;
        allAnimal.push_back(tmp);
    }
    int max = 0;
    int mxNum = 0;
    for (int i = n - 1; i >= 0; i--)
    {
        if (allAnimal[i] >= max)
        {
            max = allAnimal[i];
            mxNum++;
        }
    }
    cout << mxNum;
}
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted3ms1812 KiB
2Accepted3ms2052 KiB
subtask25/5
3Accepted3ms2268 KiB
4Accepted3ms2476 KiB
5Accepted2ms2564 KiB
subtask320/20
6Accepted2ms2568 KiB
7Accepted3ms2808 KiB
8Accepted3ms2940 KiB
9Accepted3ms2972 KiB
10Accepted3ms3060 KiB
subtask425/25
11Accepted3ms3244 KiB
12Accepted3ms3456 KiB
13Accepted3ms3512 KiB
14Accepted3ms3644 KiB
15Accepted3ms3892 KiB
subtask520/20
16Accepted2ms3980 KiB
17Accepted3ms3980 KiB
18Accepted3ms3992 KiB
19Accepted3ms4124 KiB
20Accepted3ms4344 KiB
subtask630/30
21Accepted3ms4536 KiB
22Accepted3ms4656 KiB
23Accepted3ms4800 KiB
24Accepted3ms4664 KiB
25Accepted3ms4772 KiB
26Accepted3ms4772 KiB