219082026-01-14 10:15:16kviviAranycipők (45)cpp17Accepted 45/452ms560 KiB
#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
    int n, s, a;
    cin >> n;
    int t[n];
    int i, legnagyobb=0;
    for (i=0; i<n; i++)
    {
        cin >> t[i];
        if (t[i]>legnagyobb)
        {
            legnagyobb=t[i];
        }
    }

    s=0; 
    cout << legnagyobb << endl;
    for (i=0; i<n; i++)
    {
        if(t[i]==legnagyobb)
        {
            s++;
        }
    }
    cout << s << endl;
    for (i=0; i<n; i++)
    {
        if(t[i]==legnagyobb)
        {
            cout << i+1 << endl;
        }
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base45/45
1Accepted0/01ms500 KiB
2Accepted0/01ms316 KiB
3Accepted3/31ms316 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms316 KiB
6Accepted3/31ms560 KiB
7Accepted3/31ms544 KiB
8Accepted3/31ms400 KiB
9Accepted3/31ms316 KiB
10Accepted3/32ms316 KiB
11Accepted3/31ms316 KiB
12Accepted3/31ms508 KiB
13Accepted3/31ms384 KiB
14Accepted3/32ms316 KiB
15Accepted3/32ms316 KiB
16Accepted3/31ms316 KiB
17Accepted3/32ms316 KiB