#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];

	for( i = 1 ; i < sizeof(pole)/sizeof(int) ; i ++ )
	{
		cout  << "max= " << max << " submax= " << submax <<"\t"<< "pole["<<i<<"]=" <<pole[i];
		//vzdy bude splnena nejvyse jedna podminka; presto je lepsi pouzit else-if 
		//(a to i z hlediska pochopitelnosti algoritmu)
		if(pole[i] > max)
		{
			submax = max;
			max = pole[i];
			cout << " a";
		}
		if(pole[i] > submax && pole[i] < max)
		{
			submax = pole[i];
			cout << " b";
		}
		if(max == submax) 
		{
			submax = pole[i];
			cout << " c";
		}
		cout << "\n";
	}
	cout << "FIN: max = " << max << " submax = " << submax << "\n";

}