제출 #1328142

#제출 시각아이디문제언어결과실행 시간메모리
1328142Zone_zoneePilot (NOI19_pilot)C++20
40 / 100
1095 ms1064 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e6+10;

int a[N];
ll calc(int l, int r){
    int len = (r-l+1);
    return 1LL*len*(len+1)/2;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, q;
    cin >> n >> q;
    for(int i = 1; i <= n; ++i) cin >> a[i];
    while(q--){
        int x; cin >> x;
        int ans = 0;
        int l = 1, r = 1;
        while(l <= n && r <= n){
            while(l <= n && a[l] > x) l++;
            if(l > n) break;
            r = l;
            while(r <= n && a[r] <= x) r++;
            // cerr << l << ' ' << r << '\n';
            ans += calc(l, r-1);
            l = r+1;
        }
        cout << ans << '\n';
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...