#include <iostream>
using namespace std;

int main()
{
	int pole[] =
	{
		50, 50, 50, 15, 0,
		110, 120, 130, 
		5, 50, 15, 10,  0,
		210, 230, 220,
		15, 25, 50, 5,  0,
		320, 310, 330,
		50, 95, 20, 15, 0,
		420, 430, 410,
		50, 95, 20, 15, 0,
		530, 510, 520,
		15, 25, 50, 5,  0,
		630, 620, 610
	};
	
	int i, max, submax;
	
	max = submax = pole[0];
	//nyni je max == submax, proto nejprve zajistime, aby se to zmenilo, a to
	//bud nalezenim vyssiho cisla pro max nebo nizsiho cisla pro submax
	for( i = 1 ; i < sizeof(pole)/sizeof(int) ; i ++ )
	{
		cout  << "max= " << max << " submax= " << submax <<"\t"<< "pole["<<i<<"]=" <<pole[i] << "\n";
		if( pole[i] > max ){
			max = pole[i];
			break;
		}
		if( pole[i] < max ){
			submax = pole[i];
			break;
		}
	}
	//pokud pole nebylo plné stejných cisel, tak
	//nyni uz plati: max != submax, presneji: max > submax a uz se to nezmeni
	for( i = i+1 ; i < sizeof(pole)/sizeof(int) ; i ++ )
	{
		cout  << "max= " << max << " submax= " << submax <<"\t"<< "pole["<<i<<"]=" <<pole[i] << "\n";
		if(pole[i] > max){
			submax = max;
			max = pole[i];
		}else if( pole[i] > submax && pole[i] != max){
			submax = pole[i];
		}
	}
	cout << "FIN: max = " << max << " submax = " << submax << "\n";
	
}