CS204/postmid_lab3.cpp at master · Krish03na/CS204 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
#include <bits/stdc++.h>
using namespace std;


int COUNT;


bool Valid(int A, int B, int Key, int **I, int **U, int N, int M)
{
    if (A < N && B < M && A >= 0 && B >= 0) {
        if (U[A][B] == false && I[A][B] == Key)
            return true;
        else
            return false;
    }
    else
        return false;
}


void BFS(int x, int y, int i, int j, int **in,int **r, int** v,int n, int m)
{

    if (x != y)
        return;

    v[i][j] = 1;
    COUNT++;
    int x_move[] = { 0, 0, 1, -1 };
    int y_move[] = { 1, -1, 0, 0 };


    for (int u = 0; u < 4; u++)
        if (Valid(i + y_move[u], j + x_move[u], x, in,v,n,m))
            BFS(x, y, i + y_move[u], j + x_move[u], in,r,v,n,m);
}


void RESETV(int n, int m, int **v)
{
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            v[i][j] = 0;
}

void RESETR(int key, int **in, int **r, int **v, int n, int m)
{
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (v[i][j] && in[i][j] == key)
                r[i][j] = v[i][j];
            else
                r[i][j] = 0;
        }
    }
}

int compute(int **in,int n, int m)
{
    int current_max = INT_MIN;
    int **r=new int*[n];
    for(int i=0;i<n;i++)
    r[i]=new int[m];
    int **v=new int*[n];
    for(int i=0;i<n;i++)
    v[i]=new int[m];
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            RESETV(n,m,v);
            COUNT = 0;

            if (j + 1 < m)
                BFS(in[i][j], in[i][j + 1], i, j, in,r,v,n,m);


            if (COUNT >= current_max) {
                current_max = COUNT;
                RESETR(in[i][j], in, r,v,n,m);
            }
            RESETV(n,m,v);
            COUNT = 0;


            if (i + 1 < n)
                BFS(in[i][j], in[i + 1][j], i, j, in,r,v,n,m);


            if (COUNT >= current_max) {
                current_max = COUNT;
                RESETR(in[i][j], in,r,v,n,m);
            }
        }
    }
    for(int i=0;i<n;i++)
        delete [] r[i],v[i];
    delete [] r, v;
    return current_max;
}

int main()
{
   int n,m,k;
   cin>>n>>m>>k;
   int **INPUT=new int*[n];
   for(int i=0;i<n;i++)
    INPUT[i]=new int[m];

   for(int i=0;i<n;i++)
    for(int j=0;j<m;j++)
        cin>>INPUT[i][j];

    cout<<compute(INPUT,n,m)<<endl;
    for(int i=0;i<n;i++)
        delete [] INPUT[i];
    delete [] INPUT;
    return 0;
}