每日五练---P1086 [NOIP2004 普及组] 花生采摘

 

解题思路：

把k这个时间想成步数，意思就要在k步之内从最大的开始拿，然后去第二大的。。。。，每次去下一个最大的之前都需要判断去了能不能回马路上，能就去，不能就不去。

代码：

#include<iostream>
using namespace std;
int m, n, k, arr[25][25], sum, i, o, cnt = 1, maxs, x0, y0, x1, y1, p, t, bu;

struct point
{
	int x, y;
	int number;
}ans[25];

int main()
{
	cin >> m >> n >> k;
	for (i = 1; i <= m; ++i) {
		for (o = 1; o <= n; ++o) {
			cin >> arr[i][o];
			if (arr[i][o] != 0) ans[cnt].x = i, ans[cnt].y = o, ans[cnt++].number = arr[i][o];
		}
	}
    if (cnt == 1) {
        cout << sum;
        return 0;
    }
	for (i = 1; i <= cnt; ++i) if (maxs < ans[i].number) maxs = ans[i].number, x0 = ans[i].x, y0 = ans[i].y, p = i;
    if (k - 2 * x0 > 0)
    {
        k -= (x0 + 1);
        x1 = x0, y1 = y0;
        sum += maxs;
        ans[p].number = 0;
    }
    else {
        cout << sum;
        return 0;
    }
	maxs = 0;
    while (1)
    {
        for (o = 1; o <= cnt; ++o)
        {
            if (maxs < ans[o].number)
            {
                maxs = ans[o].number;
                x0 = ans[o].x, y0 = ans[o].y;
                p = o;
            }
            else if (maxs == ans[o].number)
            {
                t = abs(x0 - x1) + abs(y0 - y1);
                bu = abs(ans[o].x - x1) + abs(ans[o].y - y1);
                if (bu < t) x0 = ans[o].x, y0 = ans[o].y, p = o;
            }
        }
        if (maxs == 0) break;
        t = abs(x0 - x1) + abs(y0 - y1);
        if (k - t - 1 >= x0)
        {
            x1 = x0, y1 = y0;
            k -= (t + 1);
            sum += maxs;
            ans[p].number = 0;
            maxs = 0;
        }
        else break;
    }
    cout << sum;
	return 0;
}

这个代码VS上运行不了，我也不知道为啥。