UVa 1330 - City Game
出處:https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4076
解題策略:
使用up[i][j]紀錄上方有幾個F,up[i][j] = up[i-1][j]+1,up[0][j]=0,i從1開始
le[i][j]儲存up[i][j]相同值的最左邊界索引值
ri[i][j]儲存up[i][j]相同值的最右邊界索引值
答案為3 * up[i][j] * (ri[i][j] - le[i][j] + 1)