제출 #624234

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
624234		PoonYaPat	Pilot (NOI19_pilot)	C++14	100 / 100	658 ms	83600 KiB

pilot

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

int n,qu,pre[1000001],pos[1000001],c[1000001];
ll ans[1000001],sum;
vector<int> h[1000001];

ll cal(ll x) {
    return x*(x+1)/2;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>n>>qu;

    for (int i=1; i<=n; ++i) {
        cin>>c[i];
        h[c[i]].push_back(i);
    }

    for (int i=1; i<=n; ++i) {
        int idx=i-1;
        while (c[i]>c[idx] && idx>=1) idx=pre[idx];
        pre[i]=idx;
    }

    for (int i=n; i>=1; --i) {
        int idx=i+1;
        while (c[i]>=c[idx] && idx<=n) idx=pos[idx];
        pos[i]=idx;
    }

    sum=cal(n);
    for (int i=1000000; i>0; --i) {
        ans[i]=sum;
        for (auto j : h[i]) {
            int r=pos[j], l=pre[j];
            sum-=cal(r-l-1);
            sum+=cal(j-l-1);
            sum+=cal(r-j-1);
        }
    }
    for (int i=1; i<=qu; ++i) {
        int x; cin>>x;
        cout<<ans[x]<<"\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