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
/* -----------------------
Autor: Tomasz Boguslawski
-------------------------- */
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<fstream>
#include<iomanip>
#include<string>
#include<sstream>
#include<cstring>
#include<map>
#include<vector>
#include<set>
#include<queue>
#include<algorithm>
#include <fstream>
#include<math.h>

#define LL long long
#define FOR(x, b, e) for(LL x = b; x <= (e); x++)
#define FORS(x, b, e, s) for(LL x = b; x <= (e); x+=s)
#define FORD(x, b, e) for(LL x = b; x >= (e); x--)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define DEBUG if (debug)
#define MIN(a,b) ((a>b)?b:a)
#define MAX(a,b) ((a>b)?a:b)

using namespace std;

LL seq[2345632];
LL N;

class Node
{
public:
    Node* prev;
    Node* next;
    LL value, index;
    Node(LL p_v, LL p_index) { value=p_v; index=p_index; prev=NULL; next=NULL;}
};

void solve()
{
    FOR(i,1,N) seq[i+N]=seq[i];
    Node* first=new Node(seq[2*N], 2*N);
    Node* last=first;
    LL maxi=1;
    LL amount=1;
    Node* node;
    Node* curr;
    Node* second;
    FORD(i,2*N-1,1)
    {
        node=new Node(seq[i],i);
        node->next=first;
        first->prev=node;
        first=node;
        amount++;
        while (first->next!=NULL && first->value >= first->next->value)
        {
            // first->next (second) must be removed:
            second=first->next;
            first->next=second->next;
            if (second->next==NULL) last=first;
            else second->next->prev=first;
            amount--;
        }
        while (last->index>=i+N)
        {
            // last must be removed:
            if (last->prev==NULL) { cout << "Error1\n"; exit(0); }
            second=last->prev;
            second->next=NULL;
            last=second;
            if (second->prev==NULL) first=last;
        }
        if (amount>maxi) maxi=amount;
    }
    cout << maxi << "\n";
}

/// MAIN
int main(int argc, char* argv[])
{
    // magic formula, which makes streams work faster:
	ios_base::sync_with_stdio(0);
	cin >> N;
	FOR(i,1,N) cin >>seq[i];
	solve();
	return 0;
}