69372023-12-20 19:05:26MagyarKendeSZLGAranycipők (45)cpp17Accepted 45/453ms3592 KiB
#include <iostream>
#include <vector>
using namespace std;

void init() {
    cin.tie(nullptr);
    cout.tie(nullptr);
    ios::sync_with_stdio(0);
}

int main() {
    init();

    int N, max_g;
    cin >> N;
    int G[N];
    for (int i = 0; i < N; i++) {
        cin >> G[i];
        max_g = max(max_g, G[i]);
    }

    vector<int> idS;

    for (int i = 0; i < N; i++) {
        if (G[i] == max_g) {
            idS.push_back(i + 1);
        }
    }

    cout << max_g << '\n' << idS.size() << '\n';

    for (int id : idS) cout << id << '\n';
}
SubtaskSumTestVerdictTimeMemory
base45/45
1Accepted0/03ms1824 KiB
2Accepted0/03ms2060 KiB
3Accepted3/33ms2128 KiB
4Accepted3/33ms2612 KiB
5Accepted3/33ms2648 KiB
6Accepted3/33ms2668 KiB
7Accepted3/33ms2640 KiB
8Accepted3/33ms2772 KiB
9Accepted3/33ms2852 KiB
10Accepted3/33ms2860 KiB
11Accepted3/33ms2984 KiB
12Accepted3/33ms3348 KiB
13Accepted3/33ms3384 KiB
14Accepted3/33ms3444 KiB
15Accepted3/33ms3464 KiB
16Accepted3/33ms3304 KiB
17Accepted3/33ms3592 KiB