区间覆盖问题C++实现

区间覆盖问题C++实现

#include<iostream>
#include<algorithm>
using namespace std;

const int maxn = 20;

struct timetable
{
	int a;
	int b;
}time[maxn];

bool comp(timetable& x, timetable& y)//多看两遍 
{
	return (x.a < y.a);
}



int main()
{
	int i, j, N, n, count;
	int begin, end;
	while (cin >> N)//N表示有几组测试数据 
	{
		while (N--)
		{
			cin >> begin >> end;//需要覆盖线段的起点和终点
			cin >> n;//n个区间 
			for (i = 0; i < n; i++)
			{
				cin >> time[i].a;
				cin >> time[i].b;
				if (time[i].a > time[i].b) {
					int temp = time[i].a;
					time[i].a = time[i].b;
					time[i].b = temp;

				}
			}

			sort(time, time + n, comp);//区间按照a从小到大排序 

			count = 0;
			int len = 0, maxlen, tmp;
			int newbegin = begin;
			i = 0;
			while (len < end - begin)
			{
				maxlen = 0;
				for (i; i < n; i++)//找当前begin情况下最长 
				{
					if (time[i].a <= newbegin)
					{
						tmp = time[i].b - newbegin;
						if (tmp > maxlen)
						{
							maxlen = tmp;
							j = i;
						}
					}
					else
						break;
				}

				if (maxlen == 0)//说明断了，不存在连续覆盖 
				{
					cout << "no exit;";
					return 0;
				}

				cout << "(" << time[j].a << "," << time[j].b << ")" << "  ";
				len += maxlen;
				count++;
				newbegin = time[j].b;//新的起点

			}
			cout << endl << count << endl;
		}
	}
}