#include<bits/stdc++.h> using namespace std; #define foru(i,a,b) for(int i=(a); i<=(b); ++i) #define ford(i,a,b) for(int i=(a); i>=(b); --i) #define rep(i,a) for(int i=0; i<(a); ++i) #define sz(a) (int)(a).size() #define all(a) (a).begin(),(a).end() #define bit(s,i) (((s)>>(i))&1) #define ii pair<int,int> #define vi vector<int> #define vii vector<ii> #define fi first #define se second #define ll long long #define eb emplace_back #define pb push_back #define __builtin_popcount __builtin_popcountll #define _ << " " << template <class X, class Y> bool maxi(X &x, Y y){return x<y?x=y,true:false;} template <class X, class Y> bool mini(X &x, Y y){return x>y?x=y,true:false;} const int N=1e6+5; int n,q,h[N],l[N],r[N]; pair<int,ll> mx[N]; ll pre[N]; void solve(){ cin>>n>>q; foru(i,1,n) cin>>h[i]; foru(i,1,n){ l[i]=i-1; while(l[i]>0 && h[l[i]]<=h[i]) l[i]=l[l[i]]; } ford(i,n,1){ r[i]=i+1; while(r[i]<=n && h[r[i]]<h[i]) r[i]=r[r[i]]; } foru(i,1,n){ mx[i].fi=h[i]; mx[i].se=1LL*(i-l[i])*(r[i]-i); } sort(mx+1,mx+1+n); foru(i,1,n){ pre[i]=pre[i-1]+mx[i].se; // cout<<mx[i].fi _ mx[i].se<<'\n'; } foru(i,1,q){ int y; cin>>y; int pos=upper_bound(mx+1, mx+1+n, pair<int,ll>(y,1e18))-mx-1; cout<<pre[pos]<<'\n'; } } int32_t main(){ #define task "test" if(fopen(task".inp", "r")){ freopen(task".inp", "r", stdin); freopen(task".out", "w", stdout); } cin.tie(0)->sync_with_stdio(0); int tc=1; //cin>>tc; foru(i,1,tc){ solve(); } }

pilot.cpp: In function 'int32_t main()':
pilot.cpp:63:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   63 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
pilot.cpp:64:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~