洛谷 P2672 推销员 贪心模拟

一道贪心模拟，稍微有点意思。不是特别难想到

首先存下X=1 时候的最远距离，及2*dis+value。记录此时的边界pos

接着拿取花费最大的点，并判断在pos左边还是右边，左边的话+value，右边的话还需要加上路之间的差

代码：

#pragma GCC optimize(2)
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<string>
#include<math.h>
#include<set>
#include<vector>
#include<iostream>
#include<queue>
#include<map>
#include<math.h>
#include<stack>
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 100;
const int inf = 0x3f3f3f3f;
typedef long long ll;
struct node
{
	int u, v, pos;
	bool flag;
}edge[maxn];
bool cmp(node a, node b)
{
	return a.v > b.v;
}
map<long long, long long>mp;
int main()
{
	//freopen("C://input.txt", "r", stdin);
	int n;
	cin >> n;
	int _max = -1;
	int _u= -1;
	int _pos = -1;
	for (int i = 1; i <= n; i++)
	{
		cin >> edge[i].u;
	}
	for (int i = 1; i <= n; i++)
	{
		cin >> edge[i].v;
		edge[i].pos = i;
		edge[i].flag = true;//未走过
		if (edge[i].u * 2 + edge[i].v > _max)
		{
			_max = edge[i].u * 2 + edge[i].v;
			_u= edge[i].u;
			_pos = edge[i].pos;
		}
	}
	edge[_pos].flag = false;
	sort(edge + 1, edge + n + 1, cmp);
	ll sum = 0;
	sum += _max;
	for (int i = 1; i <= n; i++)
	{
		if (!mp[sum])
		{
			cout << sum << endl;
			mp[sum] = 1;
		}
		if (edge[i].u >= _u&&edge[i].flag)
		{
			edge[i].flag = false;
			sum += abs(_u - edge[i].u) * 2 + edge[i].v;
			_u = edge[i].u;
		}
		else if (edge[i].flag)
		{
			edge[i].flag = false;
			sum += edge[i].v;
		}
	}
	if (!mp[sum])
	{
		cout << sum << endl;
		mp[sum] = 1;
	}
	return 0;
}
#pragma GCC optimize(2)
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<string>
#include<math.h>
#include<set>
#include<vector>
#include<iostream>
#include<queue>
#include<map>
#include<math.h>
#include<stack>
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 100;
const int inf = 0x3f3f3f3f;
typedef long long ll;
struct node
{
	int u, v, pos;
	bool flag;
}edge[maxn];
bool cmp(node a, node b)
{
	return a.v > b.v;
}
map<long long, long long>mp;
int main()
{
	//freopen("C://input.txt", "r", stdin);
	int n;
	cin >> n;
	int _max = -1;
	int _u= -1;
	int _pos = -1;
	for (int i = 1; i <= n; i++)
	{
		cin >> edge[i].u;
	}
	for (int i = 1; i <= n; i++)
	{
		cin >> edge[i].v;
		edge[i].pos = i;
		edge[i].flag = true;//未走过
		if (edge[i].u * 2 + edge[i].v > _max)
		{
			_max = edge[i].u * 2 + edge[i].v;
			_u= edge[i].u;
			_pos = edge[i].pos;
		}
	}
	edge[_pos].flag = false;
	sort(edge + 1, edge + n + 1, cmp);
	ll sum = 0;
	sum += _max;
	for (int i = 1; i <= n; i++)
	{
		if (!mp[sum])
		{
			cout << sum << endl;
			mp[sum] = 1;
		}
		if (edge[i].u >= _u&&edge[i].flag)
		{
			edge[i].flag = false;
			sum += abs(_u - edge[i].u) * 2 + edge[i].v;
			_u = edge[i].u;
		}
		else if (edge[i].flag)
		{
			edge[i].flag = false;
			sum += edge[i].v;
		}
	}
	if (!mp[sum])
	{
		cout << sum << endl;
		mp[sum] = 1;
	}
	return 0;
}