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;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
区间DP是一种动态规划的方法,用于解决区间范围内的问题。在Codeforces竞赛中,区间DP经常被用于解决一些复杂的字符串或序列相关的问题。 在区间DP中,dp[i][j]表示第一个序列前i个元素和第二个序列前j个元素的最优解。具体的转移方程会根据具体的问题而变化,但是通常会涉及到比较两个序列的元素是否相等,然后根据不同的情况进行状态转移。 对于区间长度为1的情况,可以先进行初始化,然后再通过枚举区间长度和区间左端点,计算出dp[i][j]的值。 以下是一个示例代码,展示了如何使用区间DP来解决一个字符串匹配的问题: #include <cstdio> #include <cstring> #include <string> #include <iostream> #include <algorithm> using namespace std; const int maxn=510; const int inf=0x3f3f3f3f; int n,dp[maxn][maxn]; char s[maxn]; int main() { scanf("%d", &n); scanf("%s", s + 1); for(int i = 1; i <= n; i++) dp[i][i] = 1; for(int i = 1; i <= n; i++) { if(s[i] == s[i - 1]) dp[i][i - 1] = 1; else dp[i][i - 1] = 2; } for(int len = 3; len <= n; len++) { int r; for(int l = 1; l + len - 1 <= n; l++) { r = l + len - 1; dp[l][r] = inf; if(s[l] == s[r]) dp[l][r] = min(dp[l + 1][r], dp[l][r - 1]); else { for(int k = l; k <= r; k++) { dp[l][r] = min(dp[l][r], dp[l][k] + dp[k + 1][r]); } } } } printf("%d\n", dp[n]); return 0; } 希望这个例子能帮助你理解区间DP的基本思想和应用方法。如果你还有其他问题,请随时提问。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值