126302024-12-27 09:14:31ruffbrigiAranycipők (45)cpp17Accepted 45/452ms512 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int x,n,maxi=0,k=0;
    cin>>n;
    vector<int> golok;
    for(int i=0;i<=n-1;i++)
    {
        cin>>x;
        golok.push_back(x);
        if(x>maxi) {maxi=x; k=1;}
        else if(x==maxi) k++;
    }
    cout<<maxi<<endl;
    cout<<k<<endl;
    for(int i=0;i<=n-1;i++)
    {
        if(golok[i]==maxi)
        {
            cout<<i+1<<endl;
        }
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base45/45
1Accepted0/01ms320 KiB
2Accepted0/01ms320 KiB
3Accepted3/31ms320 KiB
4Accepted3/31ms512 KiB
5Accepted3/31ms320 KiB
6Accepted3/31ms320 KiB
7Accepted3/31ms320 KiB
8Accepted3/31ms320 KiB
9Accepted3/31ms320 KiB
10Accepted3/32ms320 KiB
11Accepted3/31ms408 KiB
12Accepted3/31ms392 KiB
13Accepted3/32ms508 KiB
14Accepted3/32ms508 KiB
15Accepted3/32ms320 KiB
16Accepted3/31ms320 KiB
17Accepted3/32ms320 KiB