136402025-01-08 11:55:00kongopongAranycipők (45)cpp17Accepted 45/452ms500 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n, ln=1;
    cin >> n;
    vector <int> v;
    v.resize(n);
    for(int i=1; i<=n; i++)
    {
        cin >> v[i-1];
        if(v[i-1]>ln)
            ln=v[i-1];
    }
    int db=0;
    vector <int> g;
    g.resize(n);
    int p=0;
    for(int i=1; i<=n; i++)
    {
        if(v[i-1]==ln)
        {
            db++;
            g[p]=i;
            p++;

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