230552026-01-16 11:22:46SzBeatrixAranycipők (45)cpp17Accepted 45/452ms552 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n, maxim=0;
    cin>>n;
    int t[n];
    for(int i=0; i<n; i++)
    {
        cin>>t[i];
    }
    vector<int> v;
    for(int i=0; i<n; i++)
    {
        if(t[i]>maxim)
        {
            maxim=t[i];
        }
    }
    cout<<maxim<<endl;
    for(int i=0; i<n; i++)
    {
        if(t[i]==maxim)
        {
            v.push_back(i+1);
        }
    }
    cout<<v.size()<<endl;
    for(int i=0; i<v.size(); i++)
    {
        cout<<v[i]<<endl;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base45/45
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted3/31ms316 KiB
4Accepted3/31ms508 KiB
5Accepted3/31ms316 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms500 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms500 KiB
10Accepted3/32ms316 KiB
11Accepted3/32ms316 KiB
12Accepted3/31ms316 KiB
13Accepted3/31ms316 KiB
14Accepted3/32ms500 KiB
15Accepted3/32ms316 KiB
16Accepted3/32ms552 KiB
17Accepted3/32ms316 KiB