# 【Codeforces Round #351 Div. 2】 673C Bear and Colors

51人阅读 评论(0)

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.

【题目分析】

【代码】

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int n,col[5010],time[5010],tong[5010],maxv,maxn;
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;++i) scanf("%d",&col[i]);
for (int i=1;i<=n;++i){
memset(tong,0,sizeof tong);
maxv=0;maxn=99999;
for (int j=i;j<=n;++j){
tong[col[j]]++;
if (tong[col[j]]>maxv){
maxv=tong[col[j]];
maxn=col[j];
}
else if(tong[col[j]]==maxv&&maxn>col[j])
{
maxv=tong[col[j]];
maxn=col[j];
}
time[maxn]++;
}
}
for (int i=1;i<n;++i)
printf("%d ",time[i]);
printf("%d\n",time[n]);
return 0;
}
0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：64426次
• 积分：5485
• 等级：
• 排名：第4847名
• 原创：505篇
• 转载：1篇
• 译文：0篇
• 评论：43条
联系方式
QQ:3052857822
Email:Orion_Rigel@outlook.com