codeforce之 Bear and Colors

题目:

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.

解答:

N^2级别,在循环的同时进行更新从当前地点开始每个颜色出现的次数。然后和前一个进行比较是否更新了最大值


#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<iomanip>
#include<string.h>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<cstdio>
#include<string>

using namespace std;
int num[5002][5002] = { 0 };
int ans[5002] = { 0 };
int color[5002];
int main() {
	int n;
	cin >> n;
	for (int i = 0; i < n; ++i) {
		cin >> color[i];
	}
	for (int i = 0; i < n; ++i) {
		int max = 0;
		int temp = color[i] - 1;
		for (int j = i; j < n; ++j){
			num[i][color[j] - 1]++;
			if (num[i][color[j] - 1] > max) {
				max = num[i][color[j] - 1];
				temp = color[j] - 1;
			}
			else if (num[i][color[j] - 1] == max)
			{
				if (color[j] - 1< temp) {
					temp = color[j] - 1;
				}
			}
			ans[temp]++;
		}
	}
	for (int i = 0; i < n; ++i){
		cout << ans[i] << " ";
	}
	//system("pause");
}

阅读更多
文章标签: codeforce
上一篇codeforce之problems for round
下一篇codeforce之Bear and Two Paths
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭