643A - Bear and Colors - CodeForces Solution


implementation *1500

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
using namespace std;
int n,a[5010],vis[5010],sum[5010];
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++) vis[j]=0;
		int idx=0;
		for(int j=i;j<=n;j++){
			vis[a[j]]++;
			if(vis[a[j]]>vis[idx]) idx=a[j];
			else if(vis[a[j]]==vis[idx]){
				if(idx>=a[j]) idx=a[j];
			}
			sum[idx]++;
		}
	}
	for(int i=1;i<=n;i++) printf("%d ",sum[i]);
	return 0;
}


Comments

Submit
0 Comments
More Questions

873B - Balanced Substring
1401D - Maximum Distributed Tree
1716C - Robot in a Hallway
1688B - Patchouli's Magical Talisman
99A - Help Far Away Kingdom
622B - The Time
1688C - Manipulating History
1169D - Good Triple
1675B - Make It Increasing
588A - Duff and Meat
1541B - Pleasant Pairs
1626B - Minor Reduction
1680A - Minimums and Maximums
1713A - Traveling Salesman Problem
1713B - Optimal Reduction
1710A - Color the Picture
1686B - Odd Subarrays
251A - Points on Line
427C - Checkposts
1159A - A pile of stones
508A - Pasha and Pixels
912A - Tricky Alchemy
1249A - Yet Another Dividing into Teams
1713C - Build Permutation
1699A - The Third Three Number Problem
1617B - GCD Problem
841A - Generous Kefa
1690B - Array Decrements
1692C - Where's the Bishop
104A - Blackjack