191912025-11-28 16:08:41Teret222Aranycipők (45)cpp17Wrong answer 15/452ms512 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();
	for (int i = 0; i < res.size(); i++)
	{
		cout << res[i] << '\n';
	}
}
SubtaskSumTestVerdictTimeMemory
base15/45
1Wrong answer0/02ms316 KiB
2Wrong answer0/02ms316 KiB
3Partially correct1/32ms316 KiB
4Partially correct1/31ms500 KiB
5Partially correct1/31ms316 KiB
6Partially correct1/31ms316 KiB
7Partially correct1/31ms316 KiB
8Partially correct1/31ms508 KiB
9Partially correct1/31ms508 KiB
10Partially correct1/32ms512 KiB
11Partially correct1/32ms316 KiB
12Partially correct1/31ms316 KiB
13Partially correct1/31ms316 KiB
14Partially correct1/31ms316 KiB
15Partially correct1/31ms316 KiB
16Partially correct1/31ms316 KiB
17Partially correct1/31ms316 KiB