208702026-01-10 17:37:13LllamaAranycipők (45)cpp17Accepted 45/452ms560 KiB
#include <iostream>
#include <vector>
using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> plrs;
    int max = 0;

    for (int i = 0; i < n; i++) {
        int x;
        cin >> x;
        if (x > max) {
            max = x;
            plrs.clear();
            plrs.push_back(i+1);
        }
        else if (x == max) plrs.push_back(i+1);
    }

    cout << max << '\n' << plrs.size() << '\n';
    for (int gol : plrs) {
        cout << gol << '\n';
    }

}
SubtaskSumTestVerdictTimeMemory
base45/45
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted3/31ms316 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms316 KiB
6Accepted3/32ms536 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms316 KiB
9Accepted3/32ms316 KiB
10Accepted3/32ms316 KiB
11Accepted3/32ms316 KiB
12Accepted3/32ms512 KiB
13Accepted3/31ms316 KiB
14Accepted3/31ms520 KiB
15Accepted3/31ms560 KiB
16Accepted3/31ms560 KiB
17Accepted3/31ms500 KiB