Codeforces Round #696 (Div. 2)

F.

题意:最开始有一个序列{x},给定一个序列d[1~n],依次进行n轮操作,在第i轮操作中执行|d[i]|次操作:假设序列结尾为t,如果d[i]>0,则附加t-1,否则附加t+1.

由于值域连续,我们可以枚举端点求出最长上升子序列.

然后由于不同最长上升子序列的最大值和最小值不相交,所以我们只考虑一个区间内只有一种最大值和最小值的情况.我们用dp解决问题,设f[i, j]表示值i在第j段的方案数,f[i, j] = f[i - 1][j](if j段递增) + f[i - 1, j - 1] + ... ,然后这里有一个技巧的做法,由于最长上升子序列的性质,我们按照值域递增处理,先把每个折线左开右闭分割成多个区间,然后对每个折线的点x,记录x - 1, x, x + 1,并离散化,对每段值都进行dp转移,并用矩阵快速幂优化.

#include <bits/stdc++.h>
#define int long long
#define IOS ios::sync_with_stdio(false), cin.tie(0) 
#define ll long long 
// #define double long double
#define ull unsigned long long 
#define PII pair<int, int> 
#define PDI pair<double, int> 
#define PDD pair<double, double> 
#define debug(a) cout << #a << " = " << a << endl 
#define point(n) cout << fixed << setprecision(n)
#define all(x) (x).begin(), (x).end() 
#define mem(x, y) memset((x), (y), sizeof(x)) 
#define lbt(x) (x & (-x)) 
#define SZ(x) ((x).size()) 
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
namespace nqio{const unsigned R = 4e5, W = 4e5; char *a, *b, i[R], o[W], *c = o, *d = o + W, h[40], *p = h, y; bool s; struct q{void r(char &x){x = a == b && (b = (a = i) + fread(i, 1, R, stdin), a == b) ? -1 : *a++;} void f(){fwrite(o, 1, c - o, stdout); c = o;} ~q(){f();}void w(char x){*c = x;if (++c == d) f();} q &operator >>(char &x){do r(x);while (x <= 32); return *this;} q &operator >>(char *x){do r(*x); while (*x <= 32); while (*x > 32) r(*++x); *x = 0; return *this;} template<typename t> q&operator>>(t &x){for (r(y),s = 0; !isdigit(y); r(y)) s |= y == 45;if (s) for (x = 0; isdigit(y); r(y)) x = x * 10 - (y ^ 48); else for (x = 0; isdigit(y); r(y)) x = x * 10 + (y ^ 48); return *this;} q &operator <<(char x){w(x);return *this;}q &operator<< (char *x){while (*x) w(*x++); return *this;}q &operator <<(const char *x){while (*x) w(*x++); return *this;}template<typename t> q &operator<< (t x) {if (!x) w(48); else if (x < 0) for (w(45); x; x /= 10) *p++ = 48 | -(x % 10); else for (; x; x /= 10) *p++ = 48 | x % 10; while (p != h) w(*--p);return *this;}}qio; }using nqio::qio;
using namespace std;
const int N = 2e6 + 10, MOD = 998244353;
int n, x, a[N], a_t, d[N], m;
struct rec {
	int l, r;
}seg[N];
struct mat {
	int a[110][110];
	void init_zero() {
		for (int i = 0; i <= m; ++i) {
			for (int j = 0; j <= m; ++j) {
				for (int k = 0; k <= m; ++k) {
					a[i][j] = 0;
				}
			}
		}
	}
	void init() {
		init_zero();
		for (int i = 0; i <= m; ++i) a[i][i] = 1;
	}
	mat operator * (const mat &rhs) const {
		mat res; mem(res.a, 0);
		for (int i = 0; i <= m; ++i) {
			for (int j = 0; j <= m; ++j) {
				for (int k = 0; k <= m; ++k) {
					res.a[i][j] = (res.a[i][j] + a[i][k] % MOD * rhs.a[k][j] % MOD) % MOD;
				}
			}
		}
		return res;
	}
	mat operator ^ (int p) const {
		mat res, x = *this; res.init();
		while (p) {
			if (p & 1) res = res * x;
			p >>= 1;
			x = x * x;
		}
		return res;
	}
};
int solve(int l, int r) {
	// cout << "/ " << l << " " << r << "\n";
	m = r - l + 1;
	int s_t = 0, x = 0, d_t = 0;
	for (int i = l; i <= r; ++i) {
		seg[++s_t] = {x + (a[i] < 0 ? -1 : 1), x + a[i]};
		x += a[i];
	}
	seg[1].l = 0;
	for (int i = 1; i <= s_t; ++i) {
		d[++d_t] = seg[i].l - 1;
		d[++d_t] = seg[i].l;
		d[++d_t] = seg[i].l + 1;
		d[++d_t] = seg[i].r - 1;
		d[++d_t] = seg[i].r;
		d[++d_t] = seg[i].r + 1;
	}
	sort(d + 1, d + 1 + d_t), d_t = unique(d + 1, d + 1 + d_t) - d - 2;
	mat ans; ans.init_zero();
	ans.a[0][0] = 1;
	int lst = -1;
	mat tmp;
	for (int i = 1; i <= d_t; ++i) {
		tmp.init_zero();
		for (int j = 1; j <= s_t; ++j) {
			if (min(seg[j].l, seg[j].r) <= lst + 1 && max(seg[j].l, seg[j].r) >= d[i]) {
				if (seg[j].l < seg[j].r) {
					for (int k = 0; k <= j; ++k) {
						tmp.a[k][j] = 1;
					}
				}else {
					for (int k = 0; k < j; ++k) {
						tmp.a[k][j] = 1;
					}
				}
			}
		}
		// for (int j = 0; j <= s_t; ++j) {
			// for (int k = 0; k <= s_t; ++j) {
				// cout << tmp.a[j][k] << " ";
			// }
			// cout << "\n";
		// }
		ans = ans * (tmp ^ (d[i] - lst));
		lst = d[i];
	}
	int ret = 0;
	for (int i = 0; i <= m; ++i) {
		ret += ans.a[0][i] % MOD;
		ret %= MOD;
	}
	return ret;
}
signed main() {
	IOS;
	cin >> n >> x;
	for (int i = 1; i <= n; ++i) {
		int x;
		cin >> x;
		if (x) a[++a_t] = x;
	}
	int sum = 0, ans = 0;
	for (int i = 1; i <= a_t; ++i) {
		int res = sum;
		for (int j = i; j <= a_t; ++j) {
			res += a[j];
			ans = max(ans, res - sum);
		}
		sum += a[i];
	}
	if (ans == 0) {
		int res = 1;
		for (int i = 1; i <= a_t; ++i) {
			res = (res - a[i]) % MOD;
		}
		cout << 1 << " " << res << "\n";
		return 0;
	}
	sum = 0; int ret = 0;
	for (int i = 1; i <= a_t; ++i) {
		int res = sum, r = -1;
		for (int j = i; j <= a_t; ++j) {
			res += a[j];
			if (res - sum == ans) {
				r = j;
			}
		}
		sum += a[i];
		if (r != -1) {
			ret += solve(i, r) % MOD;
			ret %= MOD;
			i = r;
		}
	}
	cout << ans + 1 << " " << ret << "\n";
}