今天两题都不会,裂开了。
Q1
部分分是dfs枚举每个数字是加/减还是不选,复杂度是 O ( 3 n ) O(3^n) O(3n),我自己只写了这个部分分。
#include<iostream>
using namespace std;
const int N = 110, M = 1e5 + 10;
int ans, n;
int st[N], w[N];
bool hav[M];
void dfs(int u)
{
if(u == n + 1)
{
int res = 0;
for(int i = 1; i <= n; ++i)
{
if(st[i] == 1) res += w[i];
if(st[i] == -1) res -= w[i];
}
if(res > 0 && !hav[res]) hav[res] = true, ++ans;
return;
}
st[u] = -1;
dfs(u + 1);
st[u] = 0;
st[u] = 1;
dfs(u + 1);
st[u] = 0;
st[u] = 2;
dfs(u + 1);
st[u] = 0;
}
int main()
{
cin >> n;
for(int i = 1; i <= n; ++i) cin >> w[i];
dfs(1);
cout << ans << endl;
}
正解是动态规划,f[i][j]表示只从前i个砝码中选,能否凑出j重量,0表示不可以1表示可以,对于集合的划分,第i个砝码可以不重不漏地分为3种,不选/异侧/同侧,对于不选的情况,可行性等同于前i-1个中选,f[i][j] = f[i-1][j];在异侧就是等同于在前i-1个中选,重量为j+a[i],同侧同理。
/*
* @Author: gorsonpy
* @Date: 2022-12-20 14:21:21
* @Last Modified by: gorsonpy
* @Last Modified time: 2022-12-20 14:31:52
*/
#include<iostream>
using namespace std;
using LL = long long;
const int N = 110, M = 1e5 + 10 + 1e3;
int a[N], sum;
bool f[N][M];
LL ans;
int main()
{
int n;
cin >> n;
for(int i = 1; i <= n; ++i)
{
cin >> a[i];
sum += a[i];
f[i][a[i]] = true;
f[i][0] = true;
}
for(int i = 2; i <= n; ++i)
for(int j = 1; j <= sum; ++j)
{
f[i][j] = f[i - 1][j];
if(f[i - 1][j + a[i]]) f[i][j] = true;
if(f[i - 1][abs(j - a[i])]) f[i][j] = true;
}
for(int j = 1; j <= sum; ++j)
if(f[n][j]) ++ans;
cout << ans << endl;
}
Q2
这个题目分析非常复杂,我能力有限,可以直接移步这篇博客,解释的非常清楚:
链接: 括号序列
/*
* @Author: gorsonpy
* @Date: 2022-12-20 15:09:38
* @Last Modified by: gorsonpy
* @Last Modified time: 2022-12-20 15:39:34
*/
#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
using LL = long long;
const int N = 5e3 + 10, mod = 1e9 + 7;
int f[N][N];
string s;
LL cal()
{
memset(f, 0, sizeof f);
f[0][0] = 1;
for(int i = 1; i < s.size(); ++i)
{
if(s[i] == '(')
{
for(int j = 1; j < s.size(); ++j)
f[i][j] = f[i - 1][j - 1];
}
else
{
f[i][0] = (f[i - 1][0] + f[i - 1][1]) % mod;
for(int j = 1; j < s.size(); ++j)
f[i][j] = (f[i][j - 1] + f[i - 1][j + 1]) % mod;
}
}
for(int i = 0; i < s.size(); ++i)
if(f[s.size() - 1][i]) return f[s.size() - 1][i];
return -1;
}
int main()
{
cin >> s;
s = " " + s;
LL l = cal();
reverse(s.begin() + 1, s.end());
for(auto &c : s)
{
if(c == ')') c = '(';
else if(c == '(') c = ')';
}
LL r = cal();
cout << l * r % mod << endl;
return 0;
}