东华大学oj谁是老二

#include <cmath>
#include <iomanip>
#include<iostream>
using namespace std;
int main()
{
	int n;
	while (cin >> n)
	{
		int rem[100] = { 0 };
		int ram[100] = { 0 };

		int a = 0, b = 0, c = 0, d = 0;

		for (int i = 0; i < n; i++)//输入
		{
			cin >> rem[i];
			ram[i] = i;
		}

		a = rem[0];
		for (int i = 0; i < n; i++)//a为最大，b为第二大
		{
			if (rem[i] > a)
			{
				a = rem[i];
			}
		}

		 b = -99999;
		 for (int i = 0; i < n; i++)//a为最大，b为第二大
		 {
			 if (rem[i]!= a) 
			 {
				 if (rem[i] > b)
				 {
					 b = rem[i];
				 }
			 }
		 }


		int sbl[100];

		for (int i = 0; i < n; i++)//地址
		{
			if (rem[i] == b)
			{
				sbl[c] = ram[i];
				c++;
			}
		}

		if (b == -99999)cout << "none" << endl;
		else
		{
			cout << b << " ";
			for (int i = 0; i < c; i++)
			{
				if (i < c - 1)
				{
					cout << sbl[i] << " ";
				}
				if (i == c - 1)
				{
					cout << sbl[i] << endl;
				}
			}
		}
	}

	return 0;
}