제출 #1173974

#제출 시각아이디문제언어결과실행 시간메모리
1173974ezzzayPilot (NOI19_pilot)C++20
40 / 100
1093 ms1720 KiB
#include<bits/stdc++.h> using namespace std; #define ff first #define ss second #define pb push_back const int N=1e6+5; int a[N]; signed main(){ int n,q; cin>>n>>q; for(int i=1;i<=n;i++){ cin>>a[i]; } while(q--){ int x; cin>>x; int t=0; vector<int>v={0}; for(int i=1;i<=n;i++){ if(a[i]>x)v.pb(i); } v.pb(n+1); for(int i=1;i<v.size();i++){ int l=v[i-1]+1; int r=v[i]-1; int p=r-l+1; t+= (p*(p-1)/2)+p; } cout<<t<<endl; } }
#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...