127282024-12-29 10:43:12ffteklaAranycipők (45)cpp17Accepted 45/452ms556 KiB
#include <iostream>

using namespace std;

int N,i,G[10001],maxi=0,db=0;
int main()
{
    cin>>N;
    for (i=1;i<=N;++i)
        cin>>G[i];

    for (i=1;i<=N;++i)
    {
        if (G[i]>maxi) maxi=G[i];
    }
    cout<<maxi<<endl;

    for (i=1;i<=N;++i)
    {
        if (G[i]==maxi) ++db;
    }
    cout<<db<<endl;

    for (i=1;i<=N;++i)
    {
        if (G[i]==maxi) cout<<i<<endl;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base45/45
1Accepted0/01ms320 KiB
2Accepted0/01ms508 KiB
3Accepted3/31ms500 KiB
4Accepted3/31ms320 KiB
5Accepted3/31ms396 KiB
6Accepted3/31ms320 KiB
7Accepted3/31ms556 KiB
8Accepted3/31ms320 KiB
9Accepted3/31ms508 KiB
10Accepted3/32ms320 KiB
11Accepted3/31ms364 KiB
12Accepted3/31ms320 KiB
13Accepted3/31ms320 KiB
14Accepted3/31ms320 KiB
15Accepted3/32ms320 KiB
16Accepted3/31ms320 KiB
17Accepted3/32ms408 KiB