Codes/1E.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
96
97
98
99
100
101
102
103
104
#include <bits/stdc++.h>
using namespace std;
int arr[2000000 + 1];
long long int maximum = -1;
vector<pair<long long int, long long int>> v;
bool ya(int a, int b, int k)
{
    // printf("shfsadf\n");
    if (k % 2 == 0)
        return false;
    if (k < maximum)
        return false;
    else
    {
        int j = 1;
        // printf("%d\n",k);
        for (int i = a; i <= (a + b) / 2; i++)
        {
            if (arr[i] < j)
            {
                return false;
            }
            j++;
        }
        j -= 2;
        for (int i = (a + b) / 2 + 1; i <= b; i++)
        {
            if (arr[i] < j)
            {
                return false;
            }
            j--;
        }
        long long int ans = 0;
        // printf("jsdfs\n");
        j = 1;
        for (int i = a; i <= a + (k / 2); i++)
        {
            ans += (arr[i] - j);
            j++;
        }
        j -= 2;
        for (int i = a + (k / 2) + 1; i <= b; i++)
        {
            ans += (arr[i] - j);
            j--;
        }
        maximum = k;
        v.push_back({k, ans});
        // printf("%d\n",k);
    }
    return true;
}
void f(int a, int b, int k)
{
    if (a > b)
        return;
    if(k < maximum)return;
    if (!ya(a, b, k))
    {
        f(a + 1, b, k - 1);
        f(a, b - 1, k - 1);
    }
    else
    {
        return;
    }
}
int main()
{
    int t;
    scanf("%d", &t);
    while (t--)
    {
        maximum = -1;
        v.clear();
        int n;
        scanf("%d", &n);
        for (int i = 0; i < n; i++)
        {
            scanf("%d", &arr[i]);
        }
        f(0, n - 1, n);
        long long int ans;
        if (v.empty())
        {
            printf("0 0\n");
        }
        else
        {
            sort(v.begin(), v.end());
            reverse(v.begin(), v.end());
            ans = v[0].first;
            long long int mini = 10000000000000;
            int i = 0;
            while (v[i].first == ans)
            {
                mini = min(mini, v[i].second);
                i++;
            }
            printf("%lld %lld\n", ans, mini);
        }
    }
}