hdu 4618——Palindrome Sub-Array

枚舉

#include<cstdio>#include<iostream>using namespace std;int map[400][400];int n,m;int ans;bool is_reverse(int x,int y,int len){for(int i=x;i<=x+len-1;i++)for(int j=1;j<=len/2;j++)if(map[i][y+j-1]!=map[i][y+len-j])return 0;for(int i=y;i<=y+len-1;i++)for(int j=1;j<=len/2;j++)if(map[x+j-1][i]!=map[x+len-j][i])return 0;return 1;}void judge(int x,int y){int len=min(n-x+1,m-y+1);if(len<=ans)return ;while(ans<len){if(is_reverse(x,y,len)){ans=len;return ;}len--;}}int main(){int t;scanf("%d",&t);while(t--){scanf("%d%d",&n,&m);for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)scanf("%d",&map[i][j]);ans=1;for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)judge(i,j);printf("%d\n",ans);}return 0;}