136382025-01-08 11:50:23kongopongAranycipők (45)cpp17Wrong answer 30/452ms524 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
base30/45
1Wrong answer0/01ms316 KiB
2Wrong answer0/01ms316 KiB
3Partially correct2/31ms316 KiB
4Partially correct2/31ms512 KiB
5Partially correct2/31ms316 KiB
6Partially correct2/31ms316 KiB
7Partially correct2/31ms316 KiB
8Partially correct2/31ms524 KiB
9Partially correct2/31ms316 KiB
10Partially correct2/32ms316 KiB
11Partially correct2/31ms316 KiB
12Partially correct2/31ms316 KiB
13Partially correct2/31ms316 KiB
14Partially correct2/32ms316 KiB
15Partially correct2/32ms316 KiB
16Partially correct2/31ms316 KiB
17Partially correct2/32ms316 KiB