제출 #320916

#제출 시각아이디문제언어결과실행 시간메모리
320916strawberry2005Pilot (NOI19_pilot)C++14
55 / 100
1062 ms2020 KiB
#include<bits/stdc++.h>
#define deb(x) cout<<#x<<": "<<x<<endl

using namespace std;

int main(){

    long long n,q;
    cin>>n>>q;
    long long heights[n+1],planes[q];
    for(int i=0;i<n;i++) cin>>heights[i];
    for(int i=0;i<q;i++) cin>>planes[i];
    heights[n]=1e9;

    for(int i=0;i<q;i++){
        long long reach_height=planes[i];
        long long count=0,ans=0;
        for(int j=0;j<n+1;j++){
            if(heights[j]<=reach_height) count++;
            else{
                ans+=count*(count+1)/2;
                count=0;
                
            }
            //if(count!=0) ans+=count*(count+1)/2;
            
        }
        cout<<ans<<endl;
    }


    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...