1692H - Gambling - CodeForces Solution


data structures dp greedy math *1700

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	int T;
	cin >> T;
	
	while(T--) {
		int n;
		cin >> n;
		int res = 0, a, l, r;
		map<int, set<pair<int, int>>> M;
		for(int i = 0; i < n; i++) {
			int x;
			cin >> x;
			int sum = 2 * (int)M[x].size() - (i + 1);
			M[x].insert({sum - 1, i});
			auto it = M[x].begin();
			if(sum - it->first > res) {
				res = sum - it->first;
				a = x;
				l = it->second;
				r = i;
			}
		}
		cout << a << ' ' << l + 1 << ' ' << r + 1 << '\n';
		
	}
	
	return 0;
}


Comments

Submit
0 Comments
More Questions

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
1438A - Specific Tastes of Andre
1711C - Color the Picture
1194C - From S To T
110B - Lucky String
1114A - Got Any Grapes
224B - Array
125B - Simple XML
567B - Berland National Library
431B - Shower Line
282C - XOR and OR
1582B - Luntik and Subsequences
609A - Флеш-карты
1207A - There Are Two Types Of Burgers
371C - Hamburgers