Google中国编程挑战赛入围赛真题HardDuplicateRemover(1000分)

#include <iostream>
#include <vector>
#include <map>

using namespace std;


class HardDuplicateRemover
{
public:
	vector<int> process(vector<int>& elements);
};

vector<int> HardDuplicateRemover::process(vector<int>& elements)
{
	vector<int> result;

	if (elements.empty())
	{
		cout << "elements is empty!!!!!" << endl;
		return result;
	}

	for (int i = 0; i < elements.size(); i++)
	{
		int& element = elements[i];
		if (map.find(word) == map.end())
		{
			cntIndex.push_back({ 1, i });
			map.insert({ word, cntIndex.size() - 1 });
		}
		else
		{
			cntIndex[map[word]].first++;
		}
	}

	return result;
}

int main(int argc, char *argv[])
{

	map<int, vector<int>> elements;  // elements : {index}

	int tmp;
	vector<int> ints_sequence;
	while(cin >> tmp)
	{
		ints_sequence.push_back(tmp);
		if(cin.get() == '\n')
		{
			break;
		}
	}

	/*调试信息 start*/
	cout << "ints_sequence, sizes: " << ints_sequence.size() << endl;
	for (int& element : ints_sequence)
	{
		cout << element << " ";
	}
	cout << endl;
	/*调试信息 end*/

	HardDuplicateRemover remover;
	vector<int> result = remover.process(ints_sequence);

#if 0
	for(auto element : result)
	{
		cout << element << ' ';
	}
	cout << endl;
#endif

	system("pause");
	return EXIT_SUCCESS;
}