148722025-02-05 17:01:04PKBÉrdekes túra (70 pont)cpp17Partially correct 53/7029ms808 KiB
#include <iostream>
#include <vector>

using namespace std;

int main() {
    int hossz;

    cin >> hossz;

    vector<int> altitudes(hossz);



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

    int starting, ending;
    int jelenlegi = 0;

    vector<int> sor(2, -1);

    vector<vector<int>> izgalmas_turak(100, sor);

    int len = 0;
    int best_len = 0;



    for (int i = 1; i < hossz-1; i++) {
        if (altitudes[i] != altitudes[i+1]) {
            len++;
            if (len > best_len) {
                best_len = len;
            }

            if (izgalmas_turak[jelenlegi][0] == -1) {
               izgalmas_turak[jelenlegi][0] = i;
            } else {

                izgalmas_turak[jelenlegi][1] = i;
            }


        } else {
            len = 0;
            jelenlegi++;

        }
    }

    int mennyi = 0;


    for (int i = 0; i < izgalmas_turak.size(); i++) {
        if (izgalmas_turak[i][0] != -1) {
            mennyi++;
        }
    }





    if (mennyi == 0) {
        cout << "\n-1";
    } else {
        cout << mennyi << "\n";
        cout << best_len+1;
    }




}
SubtaskSumTestVerdictTimeMemory
base53/70
1Accepted0/01ms316 KiB
2Accepted0/025ms756 KiB
3Partially correct1/31ms508 KiB
4Partially correct2/31ms316 KiB
5Accepted3/31ms372 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms332 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms508 KiB
10Accepted3/31ms316 KiB
11Accepted3/31ms316 KiB
12Partially correct1/32ms384 KiB
13Accepted4/42ms420 KiB
14Accepted4/414ms604 KiB
15Accepted4/417ms648 KiB
16Runtime error0/417ms684 KiB
17Accepted4/418ms668 KiB
18Accepted4/419ms724 KiB
19Accepted4/427ms764 KiB
20Runtime error0/425ms800 KiB
21Accepted4/429ms808 KiB
22Runtime error0/423ms760 KiB