123212024-12-12 08:09:12birozsAranycipők (45)cpp11Accepted 45/452ms508 KiB
#include <iostream>

using namespace std;

int main()
{
    int n;
    cin >> n;
    int t[n];
    for (int i=0;i<n;i++) {
        cin >> t[i];
    }
    int legtobb = t[0];
    for (int i=1;i<n;i++) {
        if (t[i] > legtobb) {
            legtobb = t[i];
        }
    }
    cout << legtobb << endl;

    int db = 0;
    for (int i=0;i<n;i++) {
        if (t[i] == legtobb) {
            db++;
        }
    }
    cout << db << endl;

    for (int i=0;i<n;i++) {
        if (t[i] == legtobb) {
            cout << i+1 << endl;
        }
    }









    return 0;
}
SubtaskSumTestVerdictTimeMemory
base45/45
1Accepted0/01ms320 KiB
2Accepted0/01ms320 KiB
3Accepted3/31ms320 KiB
4Accepted3/31ms320 KiB
5Accepted3/31ms320 KiB
6Accepted3/31ms320 KiB
7Accepted3/31ms320 KiB
8Accepted3/31ms320 KiB
9Accepted3/31ms320 KiB
10Accepted3/32ms320 KiB
11Accepted3/31ms500 KiB
12Accepted3/31ms320 KiB
13Accepted3/31ms332 KiB
14Accepted3/32ms320 KiB
15Accepted3/32ms320 KiB
16Accepted3/31ms508 KiB
17Accepted3/32ms320 KiB