asd

v#include
#define maxn 1504
using namespace std;
typedef int t_array[maxn][maxn];
int n;
t_array a, f, d;
int kq[2*maxn+3];
int main()
{
freopen(“fastfood.inp”, “r”, stdin);
cin >> n;
for(int i = 1; i<= n; i++)
for(int j = 1; j> a[i][j];
for(int i = 1; i<= n; i++)
for(int j = 1; j= 1; p–)
for(int q = j; q>= 1; q–) if (a[i][j] == a[p][q])f[i][j] = max(f[i][j], f[p][q] + 1);
}
for(int i = n; i>= 1; i–)
for(int j = n; j>= 1; j–)
{
for(int p = i; p<=n; p++)
for(int q = j; q<= n; q++) if (a[i][j] == a[p][q])d[i][j] = max(d[i][j], d[p][q] + 1);
}
for(int i = 1; i<= n; i++)
for(int j = 1; j<= n; j++) kq[f[i][j] + d[i][j]] ++;
for(int i = 1; i<= 2*n-1; i++) cout << kq[i]<< " ";
return 0;
}