POJ 1928 The Peanuts

来源：互联网发布：telnet不通公网80端口编辑：程序博客网时间：2024/04/30 09:28

贪心法即可。先将花生最多的格点排序，然后以此判断能否到达并返回。

#include <iostream>#include <cstdio>#include <algorithm>#include <cmath>using namespace std;const int MAXN = 55;struct Node{int x, y, val;bool operator <(const Node& a) const{return val > a.val;}}a[MAXN * MAXN];int main(){int t, n, m, k, cur;scanf("%d", &t);while (t--){scanf("%d%d%d", &n, &m, &k);cur = 0;for (int i = 0; i < n; i++)for (int j = 0; j < m; j++){int ita;scanf("%d", &ita);if (ita){a[cur].x = i + 1;a[cur].y = j + 1;a[cur++].val = ita;}}sort(a, a + cur);int ans = 0, cou = 0;if (k < a[0].x * 2 + 1){printf("0\n");continue;}ans += a[cou].val;k -= a[cou++].x + 1;while (k > 0 && cou < cur){if(k < abs(a[cou].x-a[cou-1].x) + abs(a[cou].y-a[cou-1].y) + 1 + a[cou].x)break;ans += a[cou].val;k -= abs(a[cou].x - a[cou - 1].x) + abs(a[cou].y - a[cou - 1].y) + 1;cou++;}printf("%d\n", ans);}}

0 0