191922025-11-28 16:09:33Teret222Aranycipők (45)cpp17Accepted 45/452ms548 KiB
#include <iostream>
#include <vector>
using namespace std;

int main()
{
	int N;
	cin >> N;
	vector<int>list(N);
	for (int i = 0; i < N; i++)
	{
		cin >> list[i];
	}
	int max = list[0];
	for (int i = 1; i < N; i++)
	{
		if (list[i] > max)
			max = list[i];
	}
	vector<int>res;
	for (int i = 0; i < N; i++)
	{
		if (list[i] == max)
			res.push_back(i + 1);
	}
	cout << max << '\n';
	cout << res.size() << '\n';
	for (int i = 0; i < res.size(); i++)
	{
		cout << res[i] << '\n';
	}
}
SubtaskSumTestVerdictTimeMemory
base45/45
1Accepted0/01ms316 KiB
2Accepted0/01ms500 KiB
3Accepted3/31ms316 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms316 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms316 KiB
10Accepted3/32ms548 KiB
11Accepted3/32ms320 KiB
12Accepted3/31ms316 KiB
13Accepted3/31ms316 KiB
14Accepted3/31ms328 KiB
15Accepted3/31ms316 KiB
16Accepted3/32ms316 KiB
17Accepted3/31ms316 KiB