#include <bits/stdc++.h> #define int long long #define fi first #define se second #define pii pair<int, int> #define all(a) a.begin(), a.end() using namespace std; #ifdef LOCAL #include "C:\Users\Dell\Downloads\template\template\icpc-notebook\Utilities\debug.h" #else #define debug(...) 42 #endif const int mn = 1e6 + 5, mod = 1e9 + 7, inf = 2e9; int n, q, a[mn], ans[mn], par[mn], sz[mn], res = 0; vector <int> line[mn], query[mn]; int find(int u){ if(u == par[u]) return u; return par[u] = find(par[u]); } void join(int u, int v){ u = find(u), v = find(v); if(u == v) return; debug(u, v, sz[u], sz[v]); if(sz[u] < sz[v]) swap(u, v); res += 1ll * sz[u] * sz[v]; sz[u] += sz[v], par[v] = u; } void solve() { cin >> n >> q; for(int i = 1; i <= n; i++){ par[i] = i; cin >> a[i]; line[a[i]].push_back(i); } for(int i = 1; i <= q; i++){ int x; cin >> x; query[x].push_back(i); } for(int i = 1; i <= 1e6; i++){ for(auto x : line[i]){ sz[x] = 1, res ++; debug(x, i, sz[x - 1], sz[x + 1]); if(sz[x - 1]) join(x, x - 1); if(sz[x + 1]) join(x, x + 1); } for(auto y : query[i]) ans[y] = res; } for(int i = 1; i <= q; i++) cout << ans[i] << '\n'; } signed main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); #define task "Kawabata" if (fopen(task".INP", "r")) { freopen(task".INP", "r", stdin); freopen(task".OUT", "w", stdout); } int t = 1; // cin >> t; while (t--) solve(); return 0; } // Don't wanna lose anymore T_T // Never let me go - Kazuo Ishiguro

pilot.cpp: In function 'int main()':
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".INP", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
pilot.cpp:65:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |         freopen(task".OUT", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~