yurumi C+

#include <stdio.h>
#include <iostream>
#include <vector>
#include <fstream>
#include <string>
using namespace std;
int R=0,C=0;
int RES[2][3],Z=0;
vector < vector<bool> > M;

int mins(int a, int b, int c)
{
int m = a;
if (m > b)
    m = b;
if (m > c)
    m = c;
return m;
}
void printMaxSubSquare()
{
int i,j;
int S[R][C];
int max_of_s, max_i, max_j;


for(i = 0; i < R; i++)
    {S[i][0] = M[i][0];}


for(j = 0; j < C; j++)
    S[0][j] = M[0][j];


for(i = 1; i < R; i++)
{
    for(j = 1; j < C; j++)
    {
    if(M[i][j] == 1)
        S[i][j] = mins(S[i][j-1], S[i-1][j], S[i-1][j-1]) + 1;
    else
        S[i][j] = 0;
    }
}


max_of_s = S[0][0]; max_i = 0; max_j = 0;
for(i = 0; i < R; i++)
{
    for(j = 0; j < C; j++)
    {
    if(max_of_s < S[i][j])
    {
        max_of_s = S[i][j];
        max_i = i;
        max_j = j;
    }
    }
}
RES[Z][0]=max_i-max_of_s+1;
RES[Z][1]=(max_j-max_of_s+1);RES[Z][2]=(max_of_s);
//printf("\n Maximum size sub-matrix is: \n");
for(i = max_i; i > max_i - max_of_s; i--)
{
    for(j = max_j; j > max_j - max_of_s; j--)
    {
      M[i][j]=0;
    }
//  printf("\n");
}
}




int main()
{ int o,mm,nn;
ifstream FE("yurumi.in");
FE>>R>>C;
M.resize(R,vector <bool> (C,true));
FE>>o;
for(int i=0;i<o;i++)
{FE>>mm>>nn; M[mm-1][nn-1]=false;}
FE.close();
printMaxSubSquare();
Z++;
printMaxSubSquare();
ofstream FS("yurumi.out");
for(int i=0;i<2;i++)
    FS<<RES[i][0]<<" "<<RES[i][1]<<" "<<RES[i][2]<<endl;
FS.close();

}