159172025-03-19 09:31:54zsombAranycipők (45)cpp17Wrong answer 30/452ms508 KiB
// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    int best;
    vector<int> v(n);
    vector<int> b(0);
    for(int i = 0; i< n; i++){
        cin >> v[i];
        if(v[i] > v[best])best = i;
    }

    for(int i = 0; i< n; i++){
        if(v[i] == v[best]) b.push_back(i);
    }

    cout << v[best] << endl << b.size();

    for(int i = 0; i< b.size(); i++){
        cout << endl << b[i];
    }

}
SubtaskSumTestVerdictTimeMemory
base30/45
1Wrong answer0/01ms316 KiB
2Wrong answer0/01ms316 KiB
3Partially correct2/31ms316 KiB
4Partially correct2/31ms316 KiB
5Partially correct2/31ms496 KiB
6Partially correct2/31ms508 KiB
7Partially correct2/31ms316 KiB
8Partially correct2/31ms316 KiB
9Partially correct2/31ms316 KiB
10Partially correct2/32ms316 KiB
11Partially correct2/31ms316 KiB
12Partially correct2/31ms316 KiB
13Partially correct2/31ms316 KiB
14Partially correct2/32ms508 KiB
15Partially correct2/32ms316 KiB
16Partially correct2/31ms508 KiB
17Partially correct2/32ms316 KiB