CF 870 D题 题解

利用更新思想目标点两边最大的值，很巧妙

#include <bits/stdc++.h>
 
using namespace std;
 
void solve() {
    int n;
    cin >> n;
    vector<int> b(n);
    for (auto &i : b) cin >> i;
    vector<int> pref_mx(n), suff_mx(n);
    for (int i = 0; i < n; ++i) {
        pref_mx[i] = b[i] + i;
        suff_mx[i] = b[i] - i;
    }
    for (int i = 1; i < n; ++i) {
        pref_mx[i] = max(pref_mx[i], pref_mx[i - 1]);
    }
    for (int i = n - 2; i >= 0; --i) {
        suff_mx[i] = max(suff_mx[i], suff_mx[i + 1]);
    }
    int ans = 0;
    for (int m = 1; m < n - 1; ++m) {
        ans = max(ans, b[m] + pref_mx[m - 1] + suff_mx[m + 1]);
    }
    cout << ans << '\n';
}
 
int main() {
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);
    int t;
    cin >> t;
    while (t--) solve();
    return 0;
}

我的代码（X）

#include <bits/stdc++.h>
#define ll long long
//#define int long long
#define ull unsigned long long
#define vb v.begin()
#define ve v.end()
#define vc v.clear()
#define vs (int)v.size()
#define ss (int)s.size()
#define rs(i) resize(i)
#define ft first
#define sd second
#define inf 0x3f3f3f3f
#define P pair<int, int>
#define Pll pair<ll, ll>
#define Pis pair<int, string>
#define Psi pair<string, int>
#define Pic pair<int, char>
#define Pci pair<char, int>
#define forn(i, a, b) for (int i = a; i < b; i++)
#define fore(i, a, b) for (int i = a; i <= b; i++)
#define rofn(i, a, b) for (int i = a; i > b; i--)
#define rofe(i, a, b) for (int i = a; i >= b; i--)
#define Ios ios::sync_with_stdio(false), cin.tie(0)
const ll N = 100020;
const ll M = 110;
const int INF = 2147483647;
using namespace std;
struct ty
{
	int bea, mi;
}b[N];
bool cmp(ty x, ty y)
{
	if (x.bea != y.bea)return x.bea > y.bea;
	else return x.mi < y.mi;
}
int main()
{
	Ios;
	int t;
	cin >> t;
	while (t--)
	{
		int n;
		cin >> n;
		fore(i, 1, n)
		{
			cin >> b[i].bea;
			b[i].mi = i;
		}
		sort(b + 1, b + 1 + n, cmp);
		int ans = 0;
		fore(i, 1, n - 2)
		{
			if (b[i].bea + b[i + 1].bea + b[i + 2].bea - (max(b[i].mi, max(b[i + 1].mi, b[i + 2].mi)) - min(b[i].mi, min(b[i + 1].mi, b[i + 2].mi))) > ans)
			{
				ans = b[i].bea + b[i + 1].bea + b[i + 2].bea - (max(b[i].mi, max(b[i + 1].mi, b[i + 2].mi)) - min(b[i].mi, min(b[i + 1].mi, b[i + 2].mi)));
			}
		}
		cout << ans << endl;
	}
	return 0;
}
/*
1
8
10 8 5 10 6 2 9 5
*/
/*******************************************
				  坤坤助我
............................................
............................................
............................................
............................................
.............................1ffLf1.........
............................GGGGGGGC........
....................8CCCftCCCCC1;LLG,.......
..................:CC8CCC.CCCCCCii..........
.................CC88CCCC.CCCCCCC...........
................CC88CCCCC .8.:8CCC..........
................888 CCCCC.88888G;;,.........
,................888CC88.888888888,.........
:::...............CCC888.888888888..........
:::::............Gi1tC8f888888C88,..........
:::::::,........111tttfffffLG8888...........
:::::::::,....ii111ttttttfffttG.............
::::::::::::i111tttffffffffffttt............
::::::::::11tttttfff....fffffftt ...........
..:::::::1Lf1tff,..........fffff1...........
....,:::iiftG::::::.........,LLGtL..........
::::::;:i11t:;;;;;;::,,,,,,,,, f1ii,::,,,,,,
::::::::i11t:::::::::::::::::::f111:::::::::
::::::::111:::::::::::::::::::::t111::::::::
:::::::i1if::::::,,,,,,,,,,,,,,:i111::::::,:
,,,,,::,8G,,,,,,,,,,,,,,,,,,,,,,,tL1:,,,,,,,
,,,,,,:LGL;,,,,,,,,,,,,,,,,,,,,,,,CLf,,,,,,,
,,,,,;LGGG,,,,:,,,,,,,,,,,,,,,,,,,LGCG,,,,,,

*******************************************/