简答题
偏难
#22003
T4多边形
T4多边形



答案与解析
正确答案:<pre class="brush:cpp;toolbar:false">#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const int MAXN = 5005;
int a[MAXN];
int cnt[MAXN][MAXN];
int dp[MAXN];
int n;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
sort(a + 1, a + 1 + n);
cnt[1][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= 5001; j++) {
cnt[i+1][j] = (cnt[i+1][j] + cnt[i][j]) % mod;
cnt[i+1][min(j+a[i],5001)] = (cnt[i+1][min(j+a[i],5001)] + cnt[i][j]) % mod;
}
}
//求dp
for (int i = 1; i <= n; i++) {
dp[i] = dp[i-1];
for (int j = a[i]+1; j <= 5001; j++) dp[i] = (dp[i] + cnt[i][j]) % mod;
}
cout << dp[n];
return 0;
}</pre>
这道题暂未补解析。