139072025-01-09 10:00:10BencuAranycipők (45)cpp17Accepted 45/452ms524 KiB
#include <bits/stdc++.h>

using namespace std;
int n,s,ma,M[1001];
void be() {
    ifstream f("be.in");
    int x;
    cin>>n;
    for (int i=1; i<=n; i++) {
        cin>>x;
        if (x>ma) {
            ma=x;
            s=1;
            M[s]=i;
        }
        else {
            if(x==ma) {
                s++;
                M[s]=i;
            }
        }
    }
}

int main()
{
    be();
    cout<<ma<<endl<<s<<endl;
    for (int i=1; i<=s; i++) cout<<M[i]<<endl;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base45/45
1Accepted0/01ms316 KiB
2Accepted0/01ms500 KiB
3Accepted3/31ms316 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms316 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms316 KiB
10Accepted3/32ms316 KiB
11Accepted3/31ms316 KiB
12Accepted3/31ms316 KiB
13Accepted3/31ms400 KiB
14Accepted3/32ms524 KiB
15Accepted3/32ms316 KiB
16Accepted3/31ms316 KiB
17Accepted3/32ms316 KiB