132082025-01-07 07:51:49mateAranycipők (45)cpp17Accepted 45/451ms616 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
	cin.tie(0); ios::sync_with_stdio(0);
	int n; cin >> n;
	vector <int> v(n);
	vector <int> ans;
	int maxi = 0;
	for(int i = 0; i < n; i++){
		cin >> v[i];
		maxi = max(maxi,v[i]);
	}for(int i = 0; i < n; i++){
		if(v[i] == maxi){
			ans.push_back(i+1);
		}
	}
	cout << maxi << '\n';
	cout << ans.size() << '\n';
	for(int x : ans)	cout << x << '\n';
}
SubtaskSumTestVerdictTimeMemory
base45/45
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted3/31ms316 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms316 KiB
6Accepted3/31ms616 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms564 KiB
9Accepted3/31ms316 KiB
10Accepted3/31ms316 KiB
11Accepted3/31ms428 KiB
12Accepted3/31ms396 KiB
13Accepted3/31ms316 KiB
14Accepted3/31ms316 KiB
15Accepted3/31ms316 KiB
16Accepted3/31ms316 KiB
17Accepted3/31ms316 KiB