제출 #1340084

#제출 시각아이디문제언어결과실행 시간메모리
1340084mantaggezPilot (NOI19_pilot)C++20
55 / 100
1095 ms1380 KiB
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const ll nx = 1e6+5;
const ll INF = 1e9;

ll n, q;
ll h[nx];

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin >> n >> q;
    for(ll i=1;i<=n;i++) cin >> h[i];
    // for(ll i=1;i<=n;i++) cout << h[i] << ' '; cout << '\n';

    h[n + 1] = INF;
    while(q--) {
        ll y, ans = 0, range = 0; 
        cin >> y;
        for(ll i=1;i<=n+1;i++) {
            if(h[i] <= y) {
                range++;
                // cout << i << ' ' << range << '\n';
            }
            else {
                ans += (range * (range + 1)) / 2;
                range = 0;
            }
        }
        cout << ans << '\n';
        cout << '\n';
    }

    return 0;
}
#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...