Up

 

up

 

Up

 

up

 

#include "stdio.h"
#include "conio.h"

#define N 5

void main(){
int board[N][N] = {1, 0, 1, 1, 1,
1, 4, 5, 1, 2,
0, 1, 2, 2, 2,
2, 1, 2, 2, 6,
3, 2, 6, 2, 2 };
int data[N*N];
int a[N*N];
int i, j, m, n, x, y, z, t;
int k=0, l=0, d, p=0;

// scan from left -> right:
/*for(i=0;i<N;i++)
for(j=0;j<N;j++)
{
d=0;m=j;
data[k] = board[j];
while(board[m] == data[k] && m<N)
{
d++;
m++;
}
a[p]=d;
k++;
p++;
}*/

// scan from up -> down:
/*for(i=0;i<N;i++)
for(j=0;j<N;j++)
{
d=0;n=j;
data[k] = board[j];
while(board[n] == data[k] && n<N)
{
d++;
n++;
}
a[p]=d;
k++;
p++;
}*/

// scan cross from left -> right :
/*for(i=0;i<N;i++)
for(j=0;j<N;j++)
{
d=0;
x=i; y=j;
data[k]=board[j];

while(board[x][y] == data[k] && x<N && y<N)
{
d++;
x++; y++;
}
a[p]=d;
k++;
p++;
}*/
// scan cross from right -> left:
for(i=0;i<N;i++)
for(j=0;j<N;j++)
{
d=0;
z=i, t=j;

data[k]=board[j];
while(board[z][t] == data[k] && z<N && t>=0)
{
d++;
z++;
t--;
}
a[p]=d;
k++;
p++;
}
// find max of length
int max_length = a[0];
for(i=1;i<4*N*N;i++)
{
if(a>max_length)
max_length = a;
}
// find max of value
int b[4*N*N];
for(i=0;i<4*N*N;i++)
{
if(a== max_length)
b=data;
}
int max_value;
for(int i=0;i<4*N*N;i++)


for(int l=0;l<N;l++)
{
printf("%d",data[l]);
printf("\t");
}
/*for(int l=0;l<2*N;l++)
{
printf("%d",a[l]);
printf("\t");
if(l==N-1)
printf("\n");
}*/
getchar();
}