제출 #336419

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
336419		ncduy0303	Pilot (NOI19_pilot)	C++17	100 / 100	448 ms	40556 KiB

pilot

#include <bits/stdc++.h>

using namespace std;

#define ar array
#define ll long long

const int MAX_N = 1e6 + 1;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;

ll ps[MAX_N];

void solve() {
    int n, q; cin >> n >> q;
    vector<int> a(n), l(n), r(n);
    for (int &x : a) cin >> x;
    stack<int> st;
    for (int i = 0; i < n; i++) {
        while (st.size() && a[st.top()] <= a[i]) st.pop();
        l[i] = st.size() ? st.top() + 1 : 0;
        st.push(i);
    }
    while (st.size()) st.pop();
    for (int i = n - 1; i >= 0; i--) {
        while (st.size() && a[st.top()] < a[i]) st.pop();
        r[i] = st.size() ? st.top() - 1 : n - 1;
        st.push(i);
    }
    for (int i = 0; i < n; i++) ps[a[i]] += (ll)(i - l[i] + 1) * (r[i] - i + 1);
    for (int i = 1; i < MAX_N; i++) ps[i] += ps[i - 1];
    while (q--) {
        int x; cin >> x;
        cout << ps[x] << "\n";
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);

    int tc = 1;
    // cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case #" << t  << ": ";
        solve();
    }
}

• Subtask 1: 3 / 3
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 15 / 15
• Subtask 5: 5 / 5
• Subtask 6: 9 / 9
• Subtask 7: 14 / 14
• Subtask 8: 10 / 10
• Subtask 9: 11 / 11
• Subtask 10: 11 / 11