Submission #1318860

#TimeUsernameProblemLanguageResultExecution timeMemory
1318860discontinuousSafety (NOI18_safety)C++20
0 / 100
13 ms8248 KiB
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define int long long

const int MOD = 1e9 + 7;
const int INF = 1e15;
const int N = 1e6;

int n, m, k, a, b, c, d, h, l, r, q, u, v, x, y;
vector<int> arr(N);

void solve() {
    cin >> n;

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

    c = INF;
    x = 0;
    for(int i = 1; i<=n; i++) {
        c = min(c, i*arr[i]-x + (h-x-arr[i])-(n-i)*arr[i]);
        x += arr[i];
    }

    cout << c;
}

int32_t main() {
    ios::sync_with_stdio(false);
    cout.tie(0); cin.tie(0);

    int tc = 1;
    // cin >> tc;

    while(tc--) {
        solve();
        cout << "\n";
    }

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...