제출 #1359121

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