http://haixiaoyang.wordpress.com/category/intervalsegment/
//None overlap segments (5,10)(15,17)(18,25),
//insert (16,35), print out merged result:(5,10)(15,35)
void PrintMergRes(int a[], int b[], int n, int nBeg, int nEnd)
{
assert(a && b && n > 0 && nBeg < nEnd);
int i = 0;
bool bPrinted = false;
while (i < n)
{
if (a[i] > nEnd && !bPrinted)
{
cout<<"("<<nBeg<<" "<<nEnd<<")"<<endl;
b......
阅读全文