Codes/605D.cpp at main · Bernini0/Codes · GitHub

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
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    scanf("%d", &n);
    int arr[n];
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &arr[i]);
    }
    int ans = 0;
    for (int i = 1; i < n;)
    {
        int cnt = 1;
        // int start = i-1;
        while (i < n && arr[i - 1] < arr[i])
        {
            i++;
            cnt++;
        }
        // int end = i-1;
        ans = max(ans, cnt);
        i++;
    }
    // printf("%d\n",ans);
    // if(n==1000){
    //     printf("%d\n",ans);
    // }
    for (int i = 1; i < n; )
    {
        int cnt = 1;
        int one = 0;
        int k = -1;
        int a = arr[i-1];
        while (i < n && (a < arr[i] || one == 0))
        {
            if (a >= arr[i])
            {
                one++;
                k = i;
                a = arr[i-1];
                i++;
            }
            else
            {
                a = arr[i];
                i++;
                cnt++;
            }
        }
        ans = max(ans,cnt);
        if(k==-1){
            i++;
        }
        else{
            i = k+1;
        }
    }
    // if(n==1000){
    //     printf("%d\n",ans);
    // }
    for (int i = 1; i < n; )
    {
        int cnt = 1;
        int one = 0;
        int k = -1;
        int a = arr[i-1];
        while (i < n && (a < arr[i] || one == 0))
        {
            if ((a >= arr[i] && i -2 < 0) || (i-2>= 0 && arr[i-2] < arr[i] && a >= arr[i]))
            {
                one++;
                k = i;
                a = arr[i];
                i++;
            }
            else if(a < arr[i])
            {
                a = arr[i];
                i++;
                cnt++;
            }
            else break;
        }
        ans = max(ans,cnt);
        if(k==-1){
            i++;
        }
        else{
            i = k+1;
        }
    }
    printf("%d\n",ans);
}