UVA_11157_Dynamic Frog

#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<list>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<algorithm>
#pragma warning(disable:4996)
#include<cstdio>
#include<cstdlib>
using std::cin;
using std::cout;
using std::endl;
using std::stringstream;
using std::string;
using std::vector;
using std::list;
using std::pair;
using std::set;
using std::multiset;
using std::map;
using std::multimap;
using std::stack;
using std::queue;
using std::priority_queue;
int maxi_distance_small_rock(const vector<int>&rock)
{
	int maximum = 0;
	for (size_t i = 0; i < rock.size() - 1; i++)
	{
		maximum = std::max(maximum, rock[i + 1] - rock[i]);
	}
	return maximum;
}
int mini_distance_big_rock(const int &left,const int &right,const vector<int>&rock)//求两座大石头之间的最短距离,rock表示小石头的坐标
{
	//把小石头拆成奇偶两部分
	vector<int>odd{ left }, even{ left };
	for (size_t i = 0; i != rock.size(); i++)
	{
		if (i % 2 == 0)
		{
			odd.push_back(rock[i]);
		}
		else
		{
			even.push_back(rock[i]);
		}
	}
	odd.push_back(right); 
	even.push_back(right);
	return std::max(maxi_distance_small_rock(odd), maxi_distance_small_rock(even));
}
int main()
{
	//freopen("input.txt", "r", stdin);  
	//freopen("output.txt", "w", stdout);  
	int T,count=0;
	while (cin >> T)
	{
		while (T--)
		{
			int n, distance;
			//最大过河距离为河的宽度
			int minimum = 0;
			cin >> n >> distance;
			int curpos = 0;
			vector<int>small;
			for (int i = 0; i < n; i++)
			{
				char rock, dash; int nextpos;
				cin >> rock >> dash >> nextpos;
				if (rock == 'B')
				{
					auto curdistance = mini_distance_big_rock(curpos, nextpos, small);
					minimum = std::max(minimum, curdistance);
					small.clear();
					curpos = nextpos;
				}
				else
				{
					small.push_back(nextpos);
				}
			}
			auto curdistance = mini_distance_big_rock(curpos, distance, small);
			minimum = std::max(minimum, curdistance);
			cout << "Case " << ++count << ": "<<minimum << endl;
		}
	}
	return 0;
}