HDU 5538 House Building [Ad Hoc]

2015区域赛长春赛区Ｌ题

Description

给个n * m的地方，上面有若干个方块，问这些方块的表面积，（下面不算）

Algorithm

前后左右的表面积只要比前面一个高就可以算上，然后上表面积那个地方有方块就ans++

Code

#include <cstdio>const int maxn = 60;const int maxm = 60;const int dx[4] = {0, -1, 1, 0};const int dy[4] = {1, 0, 0, -1};void solve(){  int n, m;  scanf("%d%d", &n, &m);  int a[maxn][maxm] = {0};  for (int i = 1; i <= n; i++)    for (int j = 1; j <= m; j++)      scanf("%d", &a[i][j]);  int ans = 0;  for (int i = 1; i <= n; i++)    for (int j = 1; j <= m; j++)    {      for (int k = 0; k < 4; k++)      {        int neibor = a[i + dx[k]][j + dy[k]];        if (a[i][j] > neibor)          ans += a[i][j] - neibor;      }      if (a[i][j] > 0) ans++;    }  printf("%d\n", ans);}int main(){  int t;  scanf("%d", &t);  for (int i = 0; i < t; i++)    solve();}