解题思路:
d
p
[
i
]
[
j
]
dp[i][j]
dp[i][j]表示前
i
i
i首歌能否音调达到
j
j
j.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double lf;
typedef unsigned long long ull;
typedef pair<int,int>P;
const int inf = 0x7f7f7f7f;
const ll INF = 1e16;
const int N = 1e3+10;
const ull base = 131;
const int mod = 998244353;
inline int read(){int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}return x*f;}
inline string readstring(){string str;char s=getchar();while(s==' '||s=='\n'||s=='\r'){s=getchar();}while(s!=' '&&s!='\n'&&s!='\r'){str+=s;s=getchar();}return str;}
int random(int n){return (int)(rand()*rand())%n;}
void writestring(string s){int n = s.size();for(int i = 0;i < n;i++){printf("%c",s[i]);}}
bool is_prime(int n){if(n <2) return false;for(int i = 2;i*i <= n;i++){if(n%i == 0) return false;}return true;}
int a[N];
int dp[N][N];
int main(){
int n = read(),start = read(),m = read();
dp[0][start] = 1;
for(int i = 1;i <= n;i++){
a[i] = read();
}
for(int i = 1;i <= n;i++){
for(int j = 0;j <= m;j++){
int x = j+a[i];
if(x <= m) dp[i][j] = dp[i][j]||dp[i-1][x];
x = j-a[i];
if(x >= 0) dp[i][j] = dp[i][j]||dp[i-1][x];
}
}
for(int i = m;i >= 0;i--){
if(dp[n][i]){
printf("%d\n",i);
return 0;
}
}
puts("-1");
return 0;
}