제출 #1359106

#제출 시각아이디문제언어결과실행 시간메모리
1359106eweirdf274rPilot (NOI19_pilot)C++20
40 / 100
1096 ms4312 KiB
#include<bits/stdc++.h>
using namespace std;
int h[1000005],x[1005][1005];
int main(){
    int n,q;cin>>n>>q;
    for(int i=1;i<=n;i++)cin>>h[i];
    for(int i=1;i<=n;i++){
        for(int j=i;j<=n;j++){
            int mx=0;
            for(int k=i;k<=j;k++){
                mx=max(mx,h[k]);
            }
            x[i][j]=mx;
        }
    }
    while(q--){
        int t;cin>>t;
        int cnt=0;
        for(int i=1;i<=n;i++){
            for(int j=i;j<=n;j++){
                if(x[i][j]<=t)cnt++;
            }
        }
        cout<<cnt<<'\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...