CodeForces 673C （卡掉map&暴力枚举区间&一定要好好读题）

Bear Limak has n colored balls, arranged in one long row. Balls are numbered 1 through n, from left to right. There are n possible colors, also numbered 1 through n. The i-th ball has color ti.

For a fixed interval (set of consecutive elements) of balls we can define a dominant color. It’s a color occurring the biggest number of times in the interval. In case of a tie between some colors, the one with the smallest number (index) is chosen as dominant.

There are non-empty intervals in total. For each color, your task is to count the number of intervals in which this color is dominant.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 5000) — the number of balls.

The second line contains n integers t1, t2, …, tn (1 ≤ ti ≤ n) where ti is the color of the i-th ball.

Output

Print n integers. The i-th of them should be equal to the number of intervals where i is a dominant color.

Examples

Input

4
1 2 1 2

Output

7 3 0 0

Input

3
1 1 1

Output

6 0 0

Note

In the first sample, color 2 is dominant in three intervals:

An interval [2, 2] contains one ball. This ball’s color is 2 so it’s clearly a dominant color.
An interval [4, 4] contains one ball, with color 2 again.
An interval [2, 4] contains two balls of color 2 and one ball of color 1.
There are 7 more intervals and color 1 is dominant in all of them.

历程&感受：哈哈，这道题让我感觉又不行了呢，今天上午考试的时候wa了15次，有点丢人呢，后边我要更加努力了，我不想被大家甩在后边，加油。

反思：有个重要的原因是因为我理解错了这道题目的输出格式，想想自己真的好蠢哦，让一个不学算法的可能都能理解对吧，看来只能慢慢的积累了。

题目大意：给定n个球的颜色，标号1~n，让你分别求每个区间的主颜色（指区间内出现次数最多的颜色）， 如果某个区间的次数最多的两个颜色相同，那就取色号较小的那个。

思路：数据范围不大，暴力枚举就完事！

note：一般CF会卡map，尽量不要用。

#include <iostream>

using namespace std;

const int N = 5010;

int S[N][N], a[N], t[N];
int main()
{
    int n; cin >> n;
    
    for(int i = 1; i <= n; i ++)cin >> a[i];
    
    for(int i = 1; i <= n; i ++)
    {
        int ans = 0, ts = i;
        for(int j = i; j <= n; j ++)
        {
            S[i][a[j]] ++;
            if((ans < S[i][a[j]]) || (ans == S[i][a[j]] && a[ts] >= a[j])) 
            {
                ans = S[i][a[j]]; ts = j;
            }
            t[a[ts]] ++;
        }
    }
    
    for(int i = 1; i <= n ; i ++) printf("%d ", t[i]);

    return 0;
}

献上unordered_map超时代码，不过map是真的好用！

#include <iostream>
#include <unordered_map>


using namespace std;

const int N = 50100;

int a[N];

int t[N];

int main()
{
    int n; cin >> n;
    
    for(int i = 1; i <= n; i ++)scanf("%d",a + i);
    
    for(int i = 1; i <= n; i ++)
    {
        int ans = 0, ts = i;
        unordered_map<int, int> S;
        for(int j = i; j <= n; j ++)
        {
            S[a[j]] ++;
            
            if((ans < S[a[j]]) || (ans == S[a[j]] && a[ts] >= a[j])) 
            {
                ans = S[a[j]]; ts = j;
            }
            t[a[ts]] ++;
        }
    }
    
    for(int i = 1; i <= n ; i ++)
    {
        printf("%d ", t[i]);
    }
    return 0;
}