4314 2023. 03. 23 13:38:28 Dalm Bejgli (80 pont) cpp11 Accepted 80/80 35ms 5444 KiB 
#include <iostream>

using namespace std;

int main()
{
    int N;
    int db=0;
    int hossz;
    int maxszam=0;
    int maxindex;
    cin>>N;
    int szeletek[N];
    int dbszamok[N+1];
    for(int i=0;i<N;i++){
        cin>>szeletek[i];
        dbszamok[i+1]=0;
    }
    for(int i=0;i<N;i++){
        hossz=szeletek[i];
        dbszamok[hossz]++;
        db++;
        i=i+szeletek[i]-1;
    }
    cout<<db<<endl;
    for(int i=1;i<=N;i++){
        if(dbszamok[i]>maxszam){
            maxszam=dbszamok[i];
            maxindex=i;
        }
    }
    cout<<maxindex;
    return 0;
}
Subtask Sum Test Verdict Time Memory
base 80/80
1 Accepted 0/0 3ms 1756 KiB
2 Accepted 0/0 3ms 1916 KiB
3 Accepted 4/4 3ms 2124 KiB
4 Accepted 4/4 3ms 2368 KiB
5 Accepted 4/4 3ms 2548 KiB
6 Accepted 4/4 3ms 2756 KiB
7 Accepted 4/4 2ms 2844 KiB
8 Accepted 4/4 3ms 3004 KiB
9 Accepted 4/4 3ms 3080 KiB
10 Accepted 4/4 3ms 3216 KiB
11 Accepted 4/4 3ms 3464 KiB
12 Accepted 4/4 3ms 3476 KiB
13 Accepted 4/4 4ms 3752 KiB
14 Accepted 4/4 4ms 4112 KiB
15 Accepted 4/4 6ms 4128 KiB
16 Accepted 4/4 6ms 4060 KiB
17 Accepted 4/4 13ms 4544 KiB
18 Accepted 4/4 19ms 5324 KiB
19 Accepted 4/4 26ms 5424 KiB
20 Accepted 4/4 27ms 5320 KiB
21 Accepted 4/4 35ms 5428 KiB
22 Accepted 4/4 23ms 5444 KiB