Codes/688A.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
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
    int t;
    scanf("%d", &t);
    while (t--)
    {
        int n;
        scanf("%d", &n);
        vector<ll>arr(n);
        vector<ll>arr2(n);
        for (int i = 0; i < n; i++)
        {
            scanf("%lld", &arr[i]);
        }
        ll cnt = 0,count = 0, ans = 0;
        int k = 0,r = 0, l = 0;
        arr2 = arr;
        for (int i = 0; i < n-1; i++)
        {
            if(arr[i] == arr[i+1]){
                count++;
            }
            else{
                if(k==0){
                k = i+1;
                r++;
                }
                if(r==1){
                    l = i+1;
                }
            }
        }
        if(count==n-1 || count == n-2){
            printf("0\n");
            continue;
        }
        if(arr[0]==arr[0+1]){
            arr[k] = arr[0];
            for (int i = k+1; i < n; i++)
            {
                arr[i] += ans;
                if(arr[i] <= arr[0]){
                    cnt += abs(arr[0]-arr[i]);
                    ans += arr[0]-arr[i];
                }
                else{
                    cnt+=abs(arr[0]-arr[i]);
                    ans += arr[0]-arr[i];
                }
            }

        }
        else
        {
            arr[0] = arr[1];
            k = 1;
            for (int i = k+1; i < n; i++)
            {
                arr[i] += ans;
                if(arr[i] <= arr[0]){
                    cnt += abs(arr[0]-arr[i]);
                    ans += arr[0]-arr[i];
                }
                else{
                    cnt+=abs(arr[0]-arr[i]);
                    ans += arr[0]-arr[i];
                }
            }
            arr2[1] = arr[0];
            k = 1;
            ll ans2 = 0, cnt2 = 0;
            for (int i = k+1; i < n; i++)
            {
                arr2[i] += ans2;
                if(arr2[i] <= arr2[0]){
                    cnt2 += abs(arr2[0]-arr2[i]);
                    ans2 += arr2[0]-arr2[i];
                }
                else{
                    cnt2+=abs(arr2[0]-arr2[i]);
                    ans2 += arr2[0]-arr2[i];
                }
            }
            cnt = min(cnt,cnt2);
        }
        printf("%lld\n",cnt);
    }

}