172902025-06-17 16:38:30algoproAranycipők (45)cpp17Accepted 45/452ms544 KiB
// UUID: 604b7ee7-6557-4581-a32e-1a64eb5064a2
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
	cin>>n;
	vector<int>k(n);
	for(int i=0;i<n;i++){
		cin>>k[i];
	}
	int maxi=*max_element(k.begin(), k.end());
	vector<int> gol;
	for(int i=0;i<n;i++){
		if(maxi==k[i]){
			gol.push_back(i+1);
		}
	}
	cout<<maxi<<endl<<gol.size()<<endl;
	for(int i=0;i<gol.size();i++){
		cout<<gol[i]<<endl;
	}
}
SubtaskSumTestVerdictTimeMemory
base45/45
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted3/31ms544 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms316 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms316 KiB
10Accepted3/32ms316 KiB
11Accepted3/31ms316 KiB
12Accepted3/31ms316 KiB
13Accepted3/31ms316 KiB
14Accepted3/32ms316 KiB
15Accepted3/32ms316 KiB
16Accepted3/31ms316 KiB
17Accepted3/32ms316 KiB