제출 #1240853

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1240853		trufanov.p	Discharging (NOI20_discharging)	C++20	11 / 100	59 ms	8264 KiB

Discharging

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cctype>
#include <string>
#include <queue>
#include <unordered_set>
#include <deque>
#include <numeric>
#include <cmath>
#include <unordered_map>
#include <set>

using namespace std;

#pragma GCC optimize("O3")
#pragma GCC optimization("Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

typedef long long ll;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<ll> t(n);
    for (int i = 0; i < n; ++i) {
        cin >> t[i];
    }
    ll ans = 0;
    ll beg = 0;
    ll summ = t[0];
    ll curmax = t[0];
    for (int i = 1; i < n; ++i) {
        if (t[i] <= curmax) {
            summ += t[i];
        } else {
            ll opt1 = ((ll)n - i) * curmax;
            ll opt2 = ((ll)i - beg) * (t[i] - curmax);
            if (opt1 > opt2) {
                summ += t[i];
                curmax = t[i];
            } else {
                ans += ((ll)n - beg) * curmax;
                beg = i;
                summ = t[i];
                curmax = t[i];
            }
        }
    }
    ans += ((ll)n - beg) * curmax;
    cout << ans << '\n';
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 13
• Subtask 3: 0 / 25
• Subtask 4: 11 / 11
• Subtask 5: 0 / 14
• Subtask 6: 0 / 28