/* 
 * File:   main.cpp
 * Author: yaroslav
 *
 * Created on December 13, 2014, 10:24 AM
 */

#include <cstdlib>
#include <iostream>

using namespace std;

struct segment{
    float left;
    float right;
};

/*
 * Finding the line segment that is within each specified line segment
 */
int main(int argc, char** argv) {
    int     i, j;       // counters
    int     segnum;     // number of line segments    
    float   length;     // length of line
    int     currseg;    // Line segment with the largest left value
    
    cout << "line_segment\n";
    
    do {
        cout << "Input line segment length (1-100): ";
        cin >> length;
    } while (length < 1.0 || length > 100.0);
    
    do {
        cout << "Input number of segments (2-20): ";
        cin >> segnum;
    } while (segnum < 2 || segnum > 20);
    segment segarray[segnum];
    
    cout << "Input point coordinates in the range of 0 to " << length << "\n";
    for (i = 0; i < segnum; i++) {
        cout << "Segment #" << i+1 << ":\n";
        do {
            cout << "x1=";
            cin >> segarray[i].left;
        } while (segarray[i].left < 0 || segarray[i].left > length);
        
        do {
            cout << "x2=";
            cin >> segarray[i].right;
        } while (segarray[i].right < 0 || segarray[i].right > length 
                || segarray[i].right < segarray[i].left);
    }
    
    currseg = 0;
    for (i = 1; i < segnum; i++) {
        if (segarray[currseg].left < segarray[i].left) {
            currseg = i;    // looking for line segment with largest left value
        } else if (segarray[currseg].left == segarray[i].left) {
            if (segarray[currseg].right >= segarray[i].right) {
                currseg = i;
            }
        }
    }
    for (i = 0, j = 0; i < segnum; i++) {
        if (segarray[currseg].right <= segarray[i].right) {
            j++;    // counting segments on the line with greater right value
        }
    }
    if (j == segnum) {
        cout << "Line segment with coordinates x1=" << segarray[currseg].left;
        cout << " x2=" << segarray[currseg].right << " is inside all other\n";
    } else {
        cout << "No segment of the line that is inside all other\n";
    }
    
    return 0;
}