제출 #647398

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
647398		LeonaRaging	Pilot (NOI19_pilot)	C++14	100 / 100	375 ms	59936 KiB

pilot

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define fi first
#define se second
#define ll long long
#define pb push_back
#define db(val) "[" #val " = " << (val) << "] "

const ll mod = 1e9 + 7;
const int maxn = 1e6 + 4;
const int INF = 1e9;

int n, q, h[maxn], a[maxn], sum[maxn], pre[maxn], nxt[maxn];

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    //freopen(".INP", "r", stdin);
    //freopen(".OUT", "w", stdout);
    cin >> n >> q;
    for (int i = 1; i <= n; i++)
        cin >> h[i];
    for (int i = 1; i <= q; i++)
        cin >> a[i];
    stack<int> st;
    h[0] = h[n + 1] = INF;
    st.push(0);
    for (int i = 1; i <= n; i++) {
        while (h[st.top()] < h[i])
            st.pop();
        pre[i] = st.top();
        st.push(i);
    }
    stack<int>().swap(st);
    st.push(n + 1);
    for (int i = n; i >= 1; i--) {
        while (h[st.top()] <= h[i])
            st.pop();
        nxt[i] = st.top();
        st.push(i);
    }
    for (int i = 1; i <= n; i++) 
        sum[h[i]] += (i - pre[i]) * (nxt[i] - i);
    for (int i = 1; i <= 1e6; i++)
        sum[i] += sum[i - 1];
    for (int i = 1; i <= q; i++)
        cout << sum[a[i]] << '\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