HDU 4925 Apple Tree(推理)
2017-04-23 21:03
288 查看
HDU 4925 Apple Tree
题目链接题意:给一个m*n矩阵种树,每一个位置能够选择种树或者施肥,假设种上去的位置就不能施肥,假设施肥则能让周围果树产量乘2。问最大收益
思路:推理得到肯定是果树和肥料交叉种好,类似国际象棋棋盘,黑的种,白的施肥。因为格子数不多,直接去枚举每一个位置就可以。假设题目格子数多的话。事实上也能够推出公式一步得到答案
代码:
#include <cstdio> #include <cstring> const int d[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}}; int t, n, m; int main() { scanf("%d", &t); while (t--) { scanf("%d%d", &n, &m); int flag = 1; int ans = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (flag) { int cnt = 1; for (int k = 0; k < 4; k++) { int xx = i + d[k][0]; int yy = j + d[k][1]; if (xx < 0 || xx >= n || yy < 0 || yy >= m) continue; cnt *= 2; } ans += cnt; } flag ^= 1; } } printf("%d\n", ans); } return 0; }
相关文章推荐
- HDU 4925 Apple Tree(推理)
- HDU 4925 Apple Tree
- hdu 4925 Apple Tree
- HDU 4925 ——Apple Tree(贪心)
- HDU 4925 Apple Tree
- hdu 4925 Apple Tree 间隔着种树施肥,
- HDU 4925 Apple Tree (瞎搞)
- HDU 4925 Apple Tree
- hdu 4925 Apple Tree(贪心)
- Hdu 4925 Apple Tree
- hdu 4925 Apple Tree--2014 Multi-University Training Contest 6
- hdu 4925 Apple Tree
- hdu 4925 Apple Tree(2014 Multi-University Training Contest 6)
- 【HDU 4925】BUPT 2015 newbie practice #2 div2-C-HDU 4925 Apple Tree
- HDU 4925 Apple Tree 找呀找规律
- HDU 4925 Apple Tree(模拟题)
- hdu 4925 Apple Tree(贪心)
- 2014多校第六场 1005 || HDU 4925 Apple Tree
- hdu 4925 Apple Tree 2014 Multi-University Training Contest 6
- HDU 4925 Apple tree