Codeforces673C Bear and Colors(枚举区间)

C. Bear and Colors
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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.

题意:已知一串数字,每种数字代表一种颜色,如果一个区间[i,j]中, ai颜色出现次数最多或者有和ai出现次数一样多的颜色但是颜色编号都比ai大,那么ai就是这个区间的领导颜色,统计各种颜色领导的区间数量。

思路:枚举所有的区间,维护最大值那个颜色,当出现新的最大值时,作出更改。

#include <bits/stdc++.h>
using namespace std;
#define maxn 5005
int cnt[maxn];
int dom[maxn];
int a[maxn];
int main()
{
    int n, i, j, best;
    scanf("%d", &n);
    for(i = 1;i <= n;i++){
        scanf("%d", &a[i]);
    }

    for(i = 1;i <= n;i++)
    {
        memset(cnt, 0, sizeof cnt);
        best = a[i];
        dom[best]++;
        cnt[a[i]]++;
        for(j = i+1;j <= n;j++)
        {
            cnt[a[j]]++;
            if(cnt[a[j]] > cnt[best]){
                dom[a[j]]++;
                best = a[j];
            }
            else if(cnt[a[j]] == cnt[best]&&a[j] < best){
                dom[a[j]]++;
                best = a[j];
            }else dom[best]++;
        }
    }
    for(i = 1;i <= n;i++) printf("%d%c", dom[i], i==n?'\n':' ');
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值