1756 auto um = unordered_map<unsigned int, unsigned int>();
1757 unsigned int max_x = 0;
1758 for(
unsigned int i = 0; i < n; i++) {
1762 max_x = max(max_x, x);
1763 um.insert(pair(x, g));
1765 unsigned int count = 0;
1766 for(
int i = 0; i < 2 * k; i++) {
1767 if(um.contains(i)) {
1771 unsigned int maximum = count;
1772 for(
int i = 1; i + 2 * k <= max_x; i++) {
1773 if(um.contains(i - 1)) {
1776 if(um.contains(i + 2 * k)) {
1777 count += um[i + 2 * k];
1779 maximum = max(maximum, count);