제출 #968164

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
968164		weakweakweak	Real Mountains (CCO23_day1problem2)	C++17	0 / 25	0 ms	348 KiB

Main

#include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;


#define fs first
#define sc second

int n, a[20100], o[5100];


int main () {
    ios_base::sync_with_stdio(false); cin.tie(0);
    set<pii>st;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> o[i];
        st.insert({o[i], i});
    }

    long long ans = 0;
    int target = min(o[1], o[n]);
    while (st.begin()->fs != st.rbegin()->fs) {
        pii p = *st.begin(); st.erase(p);
        int i = p.sc;
        if (o[i] >= target) break;
        int left = INT_MAX, right = INT_MAX;
        for (int j = i - 1; j >= 1; j--) if (o[i] != o[j]) left = min(left, o[j]);
        for (int j = i + 1; j <= n; j++) if (o[i] != o[j]) right = min(right, o[j]);
        ans += o[i] * 1LL * left * right;
        st.insert({++o[i], i});
    }

    cout << ans % (1000000 + 3) << '\n';
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 3
• Subtask 3: 0 / 3
• Subtask 4: 0 / 3
• Subtask 5: 0 / 4
• Subtask 6: 0 / 5
• Subtask 7: 0 / 4