SRM 452 div1 easy
Greedy
証明は
ABAB CDCD ABAB CDCD
みたいな塗り分けをするとできる
#coding: utf-8 class NotTwo: def maxStones(self, width, height): a = [[0 for i in range(width+2)] for j in range(height+2)] ans = 0 for c in range(2,width+2): for r in range(2,height+2): if a[r-2][c] == 0 and a[r][c-2] == 0: a[r][c] = 1 ans += 1 return ans