206232026-01-08 06:48:01szjAranycipők (45)cpp17Accepted 45/452ms508 KiB
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n, ma=0, a;
    vector<int>masor;
    cin >> n;
    for(int i=1; i<=n; i++)
    {
        cin >> a;
        if(a>ma)
        {
            masor.clear();
            masor.push_back(i);
            ma=a;
        }
        else if(ma==a)masor.push_back(i);
    }
    cout << ma << endl << masor.size() << endl;
    for(auto &i: masor)cout << i << endl;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base45/45
1Accepted0/01ms316 KiB
2Accepted0/02ms508 KiB
3Accepted3/31ms316 KiB
4Accepted3/31ms316 KiB
5Accepted3/32ms508 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms508 KiB
9Accepted3/31ms316 KiB
10Accepted3/32ms316 KiB
11Accepted3/31ms316 KiB
12Accepted3/31ms316 KiB
13Accepted3/31ms316 KiB
14Accepted3/32ms316 KiB
15Accepted3/32ms316 KiB
16Accepted3/31ms384 KiB
17Accepted3/32ms316 KiB