239502026-02-02 14:31:34PKAÉrdekes túra (70 pont)cpp17Wrong answer 41/7029ms1276 KiB
#include <iostream>
#include<vector>
using namespace std;

int main()
{
    int current = 1;
    int turakszama = 0;
    int leghosszab =  0;
    int N;
    cin >> N;
    vector<int>szamok(N);
    for(int i = 0; i < N; i++){
        cin >> szamok[i];
    }
    for(int i = 1   ; i< N; i++){
        if(szamok[i]!= szamok[i-1]){
            current++;
        }else{
            if(current >= 2){
                turakszama++;
            }
            if(current > leghosszab){
                leghosszab= current;
            }
            current = 1;
        }
    }
    cout << turakszama<<endl;
    cout <<leghosszab;
}
SubtaskSumTestVerdictTimeMemory
base41/70
1Accepted0/01ms316 KiB
2Wrong answer0/025ms564 KiB
3Wrong answer0/31ms500 KiB
4Partially correct1/31ms508 KiB
5Accepted3/31ms316 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms380 KiB
9Partially correct2/31ms500 KiB
10Partially correct2/31ms316 KiB
11Partially correct2/32ms316 KiB
12Partially correct2/32ms316 KiB
13Partially correct2/42ms428 KiB
14Partially correct2/414ms844 KiB
15Partially correct2/417ms884 KiB
16Partially correct2/417ms820 KiB
17Partially correct2/419ms976 KiB
18Partially correct2/419ms820 KiB
19Partially correct2/427ms1124 KiB
20Partially correct2/425ms1168 KiB
21Partially correct2/429ms1276 KiB
22Partially correct2/421ms1076 KiB