제출 #330315

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
330315		jungsnow	Pilot (NOI19_pilot)	C++14	100 / 100	468 ms	40684 KiB

pilot

#include<bits/stdc++.h>

using namespace std;
using ll = long long;

const int maxn = 1000100;

int N, Q, H[maxn];
int L[maxn], R[maxn];
ll Ans[maxn];

int main() {
//    freopen("pilot.inp", "r", stdin);
//    freopen("pilot.out", "w", stdout);
    ios_base::sync_with_stdio(0); cin.tie(nullptr);
    cin >> N >> Q;
    stack<int> st;
    for (int i = 1; i <= N; ++i) {
        cin >> H[i];
        while (!st.empty() && H[st.top()] <= H[i]) st.pop();
        if (st.empty()) L[i] = 1;
        else L[i] = st.top() + 1;
        st.push(i);
    }
    while (!st.empty()) st.pop();
    for (int i = N; i >= 1; --i) {
        while (!st.empty() && H[st.top()] < H[i]) st.pop();
        if (st.empty()) R[i] = N;
        else R[i] = st.top() - 1;
        st.push(i);
        Ans[H[i]] += 1ll * (R[i] - i + 1) * (i - L[i] + 1);
    }
    for (int i = 1; i <= 1000000; ++i) Ans[i] += Ans[i - 1];
    for (int i = 1; i <= Q; ++i) {
        int Y; cin >> Y;
        cout << Ans[Y] << '\n';
    }
}

• 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