func_code_string: #include <bits/stdc++.h>   using namespace std;   using ll = long long;   using ull = unsigned long long;   using pii = pair<int, int>;   using pll = pair<ll, ll>;   template <class T>   inline bool Min(T &a, T b) {     return a > b ? (a = b, true) : false;   }   template <class T>   inline bool Max(T &a, T b) {     return a < b ? (a = b, true) : false;   }   inline int ni() {     int a;     scanf( %d , &a);     return a;   }   inline ll nl() {     ll a;     scanf( %lld , &a);     return a;   }   inline double nd() {     double a;     scanf( %lf , &a);     return a;   }   inline void pi(int a) { printf( %d  , a); }   inline void pl(ll a) { printf( %lld  , a); }   inline void pd(double a) { printf( %.12lf  , a); }   void solve() {     int n = ni();     vector<int> xs(n);     for (int i = 0; i < (int)(n); ++i) xs[i] = ni();     vector<int> cnt(n + 1);     vector<int> ans(n + 1);     for (int i = 0; i < n; i++) {       fill((cnt).begin(), (cnt).end(), 0);       int maxCnt = -1, maxNum = n;       for (int j = i; j < n; j++) {         cnt[xs[j]]++;         if (maxCnt <= cnt[xs[j]]) {           if (maxCnt < cnt[xs[j]] or (maxCnt == cnt[xs[j]] and xs[j] < maxNum))             maxNum = xs[j];           maxCnt = cnt[xs[j]];         }         ans[maxNum]++;       }     }     for (int i = 1; i <= n; i++) pi(ans[i]);   }   int main() {     ios_base::sync_with_stdio(false);     cin.tie(0);     cout.tie(0);     srand((int)clock());     solve();     return 0;   }   