Codes/688C.cpp at main · Bernini0/Codes · 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
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    scanf("%d", &t);
    while (t--)
    {
        int n;
        scanf("%d", &n);
        char arr[n][n];
        getchar();
        vector<pair<int,int>>v[10];
        vector<int>maximum[10];
        for (int i = 0; i < n; i++)
        {
            for(int j = 0; j < n; j++)
            {
                scanf("%c", &arr[i][j]);
                v[arr[i][j]-48].push_back({i,j});
                maximum[arr[i][j]-48].push_back(j);
            }
            getchar();
        }
        int ans[10];
        for (int i = 0; i < 10; i++)
        {
            sort(maximum[i].begin(),maximum[i].end());
            sort(v[i].begin(),v[i].end());
        }
        memset(ans,0,sizeof(ans));
        // printf("jsadfhlkasdf\n");
        for (int i = 0; i < 10; i++)
        {
            if(v[i].size()==1 || v[i].size()==0){
                ans[i] = 0;
            }
            else
            {
                for (int j = 0; j < v[i].size(); j++)
                {
                    int c = max(v[i][j].second,n-v[i][j].second-1)*max(v[i][v[i].size()-1].first-v[i][j].first,v[i][j].first-v[i][0].first);
                    int d = max(v[i][j].first,n-v[i][j].first-1)*max(maximum[i][maximum[i].size()-1]-v[i][j].second,v[i][j].second-maximum[i][0]);
                    // printf("%d: %d %d\n",i,c,d);
                    c = max(c,d);
                    ans[i] = max(ans[i],c);
                }

            }
        }
        for (int i = 0; i < 10; i++)
        {
            printf("%d ", ans[i]);
        }
        printf("\n");
    }

}