207262026-01-08 18:15:38KoszorusBlankaAranycipők (45)cpp17Accepted 45/453ms528 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int N;
    cin >> N;
    vector <int> Golok(N+1);
    for (int i = 1; i <= N; i++) { cin >> Golok[i]; }

    int max = Golok[1];
    vector <int> Nyertesek;
    for (int i = 1; i <= N; i++) {
        if (Golok[i] > max) {
            max = Golok[i];
            Nyertesek.clear();
            Nyertesek.push_back(i);
        }else if (Golok[i] == max)  { Nyertesek.push_back(i); }
    }

    cout << max << endl << Nyertesek.size() << endl;
    for (int i = 0; i < Nyertesek.size(); i++) { cout << Nyertesek[i] << endl; }

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base45/45
1Accepted0/01ms316 KiB
2Accepted0/01ms508 KiB
3Accepted3/31ms316 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms316 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms316 KiB
9Accepted3/32ms508 KiB
10Accepted3/33ms500 KiB
11Accepted3/32ms316 KiB
12Accepted3/32ms316 KiB
13Accepted3/31ms316 KiB
14Accepted3/32ms528 KiB
15Accepted3/32ms316 KiB
16Accepted3/31ms508 KiB
17Accepted3/32ms316 KiB