Sum of Three Terms(构造)

https://atcoder.jp/contests/arc135/tasks
#include<iostream>
#include<map>
#include<cstring>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define pii pair<int, int>
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fir first
#define pb push_back
#define sec second
#define sortall(x) sort((x).begin(),(x).end())
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
const int mod = 998244353;
const int N = 3e5 + 10;

int a[N];
int s[N];
int n;
void solve() {
	cin >> n;
	for (int i = 0; i< n; i ++) cin >> a[i];
	
	int minvy = 0, minvx = 0;
	//负数不用考虑，因为他原本是正数，就一定满足大于等于0的条件，然后我们只要找到最小的负数就行了
	int maxx = 0x3f3f3f3f;
	
	for (int i = 2; i< n + 2; i ++) {
		s[i] = a[i - 2] - s[i - 1] - s[i - 2];
		if (i % 3 == 0) {
			minvy = max (minvy, -s[i]);
		} 
		else if (i % 3 == 1) {
			minvx = max(minvx, -s[i]);
		}
		else {
			maxx  = min(maxx, s[i]);
		}
	}
	if (minvy + minvx > maxx) {
		puts("No");
		return ;
	}
	puts("Yes");
	s[0] = minvy, s[1] = minvx;
	for (int i = 2; i < n + 2; i ++) 
		s[i] = a[i - 2] - s[i - 1] - s[i - 2];
	for (int i = 0; i < n + 2; i ++)
		cout << s[i] << " \n"[i == n + 1];
}
int main () {
    int t;
    t = 1;
    while (t --) solve();
    return 0;
}

这题通过找边界范围然后构造可行解的。 通过对公式化简 可以发现 i % 3 == 0 s[i] = x +a i % 3 == 1 s[i] = x + b i % 3== 2 s[i] = x - a - b 我们要找到是否可行的极限条件 为此我们构造出 c1, c2, c3 c1 <= a c2 <= b a + b <=c3 c1 + c2<= a + b <= c3 左边取最大，右边取最小然后判断是否满足大小关系判断是否可行。 如果满足直接把值代入就可以了