1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
#include <iostream>
#include <set>
#include <cstdint>


using namespace std;


static size_t iSize, iAnswer;

static set<int32_t> s;

static int32_t a[1 << 20];


static void ReadData()
{
	cin >> iSize;

	for (int i = 0; i < iSize; ++i)
	{
		cin >> a[i];
	}
}


static void Init(int iStart)  // called when the set is empty
{
	int iCurrMax = a[iStart];

	s.insert(iCurrMax);

	for (int i = 1; i < iSize; ++i)
	{
		iStart++;
		iStart %= iSize;

		if (a[iStart] > iCurrMax)
		{
			iCurrMax = a[iStart];
			s.insert(iCurrMax);
		}
	}
}


static void UpdateSet(int iStart, int iLimit)  // called when the set is NOT empty
{
	int iCurrMax = a[iStart];

	if (iCurrMax >= iLimit)
		return;

	s.insert(iCurrMax);

	for (int i = 1; i < iSize; ++i)
	{
		iStart++;
		iStart %= iSize;

		if (a[iStart] >= iLimit)
			return;

		if (a[iStart] > iCurrMax)
		{
			iCurrMax = a[iStart];
			s.insert(iCurrMax);
		}
	}
}


static inline void UpdateAnswer()
{
	if (s.size() > iAnswer)
		iAnswer = s.size();
}


static void Solve()
{
	int iNewLeftPearl, m;

	if (iAnswer == iSize)
		return;

	for (int i = 0; i < iSize - 1; ++i)
	{
		m = a[i];  // the pearl we move

		iNewLeftPearl = a[i + 1];

		if (m == iNewLeftPearl)
			continue;

		s.erase(s.begin());  // delete old left pearl from the set

		if (s.size() == 0)
		{
			Init(i + 1);
			UpdateAnswer();
			continue;
		}

		UpdateSet(i + 1, *s.begin());

		if (m > *s.rbegin())
			s.insert(m);

		UpdateAnswer();

		if (iAnswer == iSize)
			return;
	}
}


int main()
{
	// freopen("sample_input.txt", "r", stdin);
	// freopen("sample_output.txt", "w", stdout);

	ReadData();

	if (iSize == 1)
	{
		cout << 1;
		return 0;
	}

	if (iSize == 2)
	{
		cout << (a[0] == a[1] ? 1 : 2);
		return 0;
	}

	Init(0);

	iAnswer = s.size();

	Solve();

	cout << iAnswer;
}