Algorithmic-Problems/integerSequence.cpp at main · pi34/Algorithmic-Problems · 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
#include <iostream>
#include <vector>

using namespace std;

int main ()
{
    int n;
    cin >> n;

    int arr[n];
    for (int i = 0; i < n; i++) cin >> arr[i];

    int dp1[n];

    for (int i = 0; i < n; i++) dp1[i] = 1;

    for (int i = 1; i < n; i++) {
        for (int j = 0; j < i; j++) {
            if (arr[i] > arr[j]) {
                dp1[i] = max(dp1[j]+1, dp1[i]);
            }
        }
    }

    int dp2[n];

    for (int i = 0; i < n; i++) dp2[i] = 1;

    for (int i = n-2; i >= 0; i--) {
        for (int j = n-1; j > i; j--) {
            if (arr[i] > arr[j]) {
                dp2[i] = max(dp2[j]+1, dp2[i]);
            }
        }
    }

    int maxim = 0;

    for (int i = 0; i < n; i++) {
        maxim = max(maxim, dp1[i]+dp2[i]-1);
    }

    cout << n - maxim << endl;
}