Coding-Ninjas/bitonic.cpp at master · Ramannoby/Coding-Ninjas · 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
96
#include<bits/stdc++.h>
using namespace std;
int main() {
        int n;
        cin>>n;
        int a[n];
        for(int i=0;i<n;i++)
        {
            cin>>a[i];
        }
        int inc[n]={1};
        int increv[n]={1};
        int maxm=0;
        int maxrevinc=0;
        int maxinc=0;
        int bitonic[n];
        for(int i=1;i<n;i++)
        {
            if(a[i]>=a[i-1])
            {
                inc[i]+=inc[i-1];
                maxinc=max(maxinc,inc[i]);
            }
        }
        for(int i=n-2;i>=0;i--)
        {
            if(a[i]>=a[i+1])
            {
                increv[i]+=increv[i-1];
                maxrevinc=max(maxrevinc,increv[i]);
            }
        }
        for(int i=0;i<n;i++)
        {
            bitonic[i]=inc[i]+increv[i]-1;
            maxm=max(maxm,bitonic[i]);
        }
       /* if(maxm>=maxrevinc && maxm>=maxinc)
        cout<<maxm<<endl;
        else if(maxrevinc>maxm && maxrevinc>maxinc)
        cout<<maxrevinc<<endl;
        else*/
        cout<<maxm<<endl;
}


#include<bits/stdc++.h>
using namespace std;
int main() {
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        int a[n];
        for(int i=0;i<n;i++)
        {
            cin>>a[i];
        }
    int inc[n];
    inc[0]=1;
        int increv[n];
        increv[n-1]=1;
        int maxm=0;
        for(int i=1;i<n;i++)
        {
            if(a[i]>=a[i-1])
            {
                inc[i]=inc[i-1]+1;
            }
            else
            inc[i]=1;
        }

        for(int i=n-2;i>=0;i--)
        {
            if(a[i]>=a[i+1])
            {
                increv[i]=increv[i+1]+1;
            }
            else
            increv[i]=1;
        }
        maxm=inc[0]+increv[0]-1;
        for(int i=1;i<n;i++)
        {
        if(inc[i]+increv[i]-1>maxm)
        maxm=inc[i]+increv[i]-1;

        }
        cout<<maxm<<endl;
}
}