2012 02. B Правоъгълници препокриване

// primeren input:
// 3 // 3 testa
// 1 20 // panica 1 = 20
// 2 30 //
// 3 50 //
// OUTPUT: 100
//


#include <iostream>
#include <string>
#include <string.h>
#include <cstdlib>
#include <sstream>      // std::stringstream

using namespace std;


string input = "123";
string output;
int broiTestove = 1;
int broiPravoygylnici =4;
int cordinates[3][3] = {};
bool overLapping = 0;
int counter = 0;
int maxCounter = 0;
int main()
{
    cin >> broiTestove;

    cin >> broiPravoygylnici;

    for(int i =0; i<=4; i++)
    {

        getline(cin, input);
        stringstream  stream(input);

        stream >> input;
        cordinates[i][0] = atoi(input.c_str());

        stream >> input;
        cordinates[i][1] = atoi(input.c_str());

        stream >> input;
        cordinates[i][2] = atoi(input.c_str());

        stream >> input;
        cordinates[i][3] = atoi(input.c_str());
    }

        for(int i =0; i<4; i++) {




            if (cordinates[i][0] > cordinates[i+1][0] || cordinates[i+1][0] > cordinates[i][0])
                overLapping = 0;


            // If one rectangle is above other
            if (cordinates[i][1] < cordinates[i+1][1] || cordinates[i+1][1] < cordinates[i][1])
           // if (l1.y < r2.y || l2.y < r1.y)
                overLapping = 0;

            else
                overLapping = 1;


        int a1 = abs(cordinates[i][0]-cordinates[i][2]);
        int b1 = abs(cordinates[i][1]-cordinates[i][3]);
        int area1 = a1*b1;

        int a2 = abs(cordinates[i+1][0]-cordinates[i+1][2]);
        int b2 = abs(cordinates[i+1][1]-cordinates[i+1][3]);
        int area2 = a1*b1;
        if((area1 > area2) && overLapping == 1)
        {
            counter++;
            if(counter >maxCounter)
                maxCounter = counter;

        }
        else
        {
            counter =0;
        }



}


        cout << maxCounter;
}