problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03171 | #include <bits/stdc++.h>
using namespace std;
string s;
long long dp[3000][3000][2];
long long a[3001];
long long solve(long long st, long long en, long long t) {
// cout<<st<<" "<<en<<" "<<t<<endl;
if (st == en) {
if (t) {
dp[st][st][1] = a[st];
return a[st];
} else
{
dp[st][st][0] = -a[st];
return -a[st];
}
}
long long ma = 0;
if (t) {
if (dp[st][en][1] != 1000000000000) {
ma = dp[st][en][1];
} else
{
ma = max(a[st] + solve(st + 1, en, 0), a[en] + solve(st, en - 1, 0));
dp[st][en][1] = ma;
}
} else {
if (dp[st][en][0] != 1000000000000) {
ma = dp[st][en][0];
} else
{
ma = max(-a[st] + solve(st + 1, en, 1), -a[en] + solve(st, en - 1, 1));
dp[st][en][0] = ma;
}
}
return ma;
}
int main() {
long long n;
cin >> n;
for (long long i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
dp[i][j][0] = 1000000000000;
dp[i][j][1] = 1000000000000;
}
}
long long ans;
ans = solve(0, n - 1, 1);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
string s;
long long dp[3000][3000][2];
long long a[3001];
long long solve(long long st, long long en, long long t) {
// cout<<st<<" "<<en<<" "<<t<<endl;
if (st == en) {
if (t) {
dp[st][st][1] = a[st];
return a[st];
} else
{
dp[st][st][0] = -a[st];
return -a[st];
}
}
long long ma = 0;
if (t) {
if (dp[st][en][1] != 1000000000000) {
ma = dp[st][en][1];
} else
{
ma = max(a[st] + solve(st + 1, en, 0), a[en] + solve(st, en - 1, 0));
dp[st][en][1] = ma;
}
} else {
if (dp[st][en][0] != 1000000000000) {
ma = dp[st][en][0];
} else
{
ma = min(-a[st] + solve(st + 1, en, 1), -a[en] + solve(st, en - 1, 1));
dp[st][en][0] = ma;
}
}
return ma;
}
int main() {
long long n;
cin >> n;
for (long long i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
dp[i][j][0] = 1000000000000;
dp[i][j][1] = 1000000000000;
}
}
long long ans;
ans = solve(0, n - 1, 1);
cout << ans << endl;
} | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 979,455 | 979,456 | u022311705 | cpp |
p03171 | // zukonit14 - Kunal Raut
#include <bits/stdc++.h>
using namespace std;
/*/-----------------------------DEFINES----------------------------------/*/
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define mod1 1000000007
#define pi 3.1415926535
#define MAXN 1 * 1000000 + 10
#define MAX2N 1 * 1000 + 10
const ll INF = 1e18;
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define ms(s, n) memset(s, n, sizeof(s))
#define prec(n) fixed << setprecision(n)
#define forci(p, n) for (ll i = p; i < (ll)n; i++)
#define forcj(p, n) for (ll j = p; j < (ll)n; j++)
#define bolt \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define bits(a) __builtin_popcountll(a)
#define djokovic \
freopen("input00.txt", "r", stdin); \
freopen("output00.txt", "w", stdout);
#define inrange(i, a, b) ((i >= min(a, b)) && (i <= max(a, b)))
clock_t time_p = clock();
void rtime() {
time_p = clock() - time_p;
cout << "\nTime Taken : " << fixed << (float)(time_p) / CLOCKS_PER_SEC
<< "s\n";
}
/*/-----------------------------INLINE
* FUNCTIONS----------------------------------/*/
inline ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
inline ll lcm(ll a, ll b) { return (a / gcd(a, b) * b); }
// inline ll expo(ll x, ll y) {ll res = 1; x = x % mod; while (y > 0)
// {if (y & 1)res = (1ll * res * x) % mod; y = y >> 1; x = (1ll * x * x) % mod;}
// return res % mod;} inline ll inv_mod(ll q, ll m = mod1) {return (expo(q, m -
// 2) % m);}
inline ll ncr(ll n, ll r) {
ll res = 1;
if (r > n - r)
r = n - r;
for (ll i = 0; i < r; i++) {
res *= n - i;
res /= i + 1;
}
return res;
}
inline bool prime(ll n) {
ll i;
for (i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return true;
}
/*/-----------------------------TRACE
* FUNCTIONS----------------------------------/*/
template <class T> ostream &operator<<(ostream &os, string V) {
os << "[ ";
for (auto v : V)
os << v << " ";
return os << "]";
}
template <class T> ostream &operator<<(ostream &os, vector<T> V) {
os << "[ ";
for (auto v : V)
os << v << " ";
return os << "]";
}
template <class T> ostream &operator<<(ostream &os, set<T> S) {
os << "{ ";
for (auto s : S)
os << s << " ";
return os << "}";
}
template <class T, class T1> ostream &operator<<(ostream &os, map<T, T1> S) {
os << "{ ";
for (auto s : S)
os << "(" << s.first << "," << s.second << ") ";
return os << "}";
}
template <class L, class R> ostream &operator<<(ostream &os, pair<L, R> P) {
return os << "(" << P.first << "," << P.second << ")";
}
#define tracearr(a, n) \
{ \
cout << #a << " : "; \
cout << "[ "; \
for (ll i = 0; i < n; i++) \
cout << a[i] << " "; \
cout << "]\n"; \
}
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
/*/-----------------------------MODULAR
* ARITHMETIC----------------------------------/*/
const ll mod = 1e9 + 7;
// const ll mod = 998244353;
inline ll add(ll x, ll y) {
x += y;
if (x >= mod)
return x - mod;
return x % mod;
}
inline ll sub(ll x, ll y) {
x -= y;
if (x < 0)
return x + mod;
return x;
}
inline ll mul(ll x, ll y) { return (x * 1ll * y) % mod; }
inline ll expo(ll x, ll y) {
ll ans = 1;
while (y) {
if (y & 1)
ans = mul(ans, x);
x = mul(x, x);
y >>= 1;
}
return ans % mod;
}
inline ll inv(ll x) { return expo(x, mod - 2); }
/*/-----------------------------CODE BEGINS----------------------------------/*/
ll rr[] = {0, 1, 1, 1, 0, -1, -1, -1};
ll cc[] = {1, 1, 0, -1, -1, -1, 0, 1};
ll n, m, k, x, q, a[MAXN], b[MAXN], a1[MAXN];
void solve() {
cin >> n;
for (ll i = 1; i <= n; i++)
cin >> a[i];
vector<vector<int>> dp(n + 1, vector<int>(n + 1, 0));
for (ll l = n; l >= 1; l--) {
for (ll r = l; r <= n; r++) {
if (l == r)
dp[l][r] = a[l];
else
dp[l][r] = max(a[l] - dp[l + 1][r], a[r] - dp[l][r - 1]);
}
}
cout << dp[1][n];
}
signed main() {
bolt;
// #ifndef ONLINE_JUDGE
// djokovic;
// #endif
ll t;
t = 1;
// cin >> t;
while (t--) {
solve();
}
// rtime();
}
| // zukonit14 - Kunal Raut
#include <bits/stdc++.h>
using namespace std;
/*/-----------------------------DEFINES----------------------------------/*/
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define mod1 1000000007
#define pi 3.1415926535
#define MAXN 1 * 1000000 + 10
#define MAX2N 1 * 1000 + 10
const ll INF = 1e18;
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define ms(s, n) memset(s, n, sizeof(s))
#define prec(n) fixed << setprecision(n)
#define forci(p, n) for (ll i = p; i < (ll)n; i++)
#define forcj(p, n) for (ll j = p; j < (ll)n; j++)
#define bolt \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define bits(a) __builtin_popcountll(a)
#define djokovic \
freopen("input00.txt", "r", stdin); \
freopen("output00.txt", "w", stdout);
#define inrange(i, a, b) ((i >= min(a, b)) && (i <= max(a, b)))
clock_t time_p = clock();
void rtime() {
time_p = clock() - time_p;
cout << "\nTime Taken : " << fixed << (float)(time_p) / CLOCKS_PER_SEC
<< "s\n";
}
/*/-----------------------------INLINE
* FUNCTIONS----------------------------------/*/
inline ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
inline ll lcm(ll a, ll b) { return (a / gcd(a, b) * b); }
// inline ll expo(ll x, ll y) {ll res = 1; x = x % mod; while (y > 0)
// {if (y & 1)res = (1ll * res * x) % mod; y = y >> 1; x = (1ll * x * x) % mod;}
// return res % mod;} inline ll inv_mod(ll q, ll m = mod1) {return (expo(q, m -
// 2) % m);}
inline ll ncr(ll n, ll r) {
ll res = 1;
if (r > n - r)
r = n - r;
for (ll i = 0; i < r; i++) {
res *= n - i;
res /= i + 1;
}
return res;
}
inline bool prime(ll n) {
ll i;
for (i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return true;
}
/*/-----------------------------TRACE
* FUNCTIONS----------------------------------/*/
template <class T> ostream &operator<<(ostream &os, string V) {
os << "[ ";
for (auto v : V)
os << v << " ";
return os << "]";
}
template <class T> ostream &operator<<(ostream &os, vector<T> V) {
os << "[ ";
for (auto v : V)
os << v << " ";
return os << "]";
}
template <class T> ostream &operator<<(ostream &os, set<T> S) {
os << "{ ";
for (auto s : S)
os << s << " ";
return os << "}";
}
template <class T, class T1> ostream &operator<<(ostream &os, map<T, T1> S) {
os << "{ ";
for (auto s : S)
os << "(" << s.first << "," << s.second << ") ";
return os << "}";
}
template <class L, class R> ostream &operator<<(ostream &os, pair<L, R> P) {
return os << "(" << P.first << "," << P.second << ")";
}
#define tracearr(a, n) \
{ \
cout << #a << " : "; \
cout << "[ "; \
for (ll i = 0; i < n; i++) \
cout << a[i] << " "; \
cout << "]\n"; \
}
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
/*/-----------------------------MODULAR
* ARITHMETIC----------------------------------/*/
const ll mod = 1e9 + 7;
// const ll mod = 998244353;
inline ll add(ll x, ll y) {
x += y;
if (x >= mod)
return x - mod;
return x % mod;
}
inline ll sub(ll x, ll y) {
x -= y;
if (x < 0)
return x + mod;
return x;
}
inline ll mul(ll x, ll y) { return (x * 1ll * y) % mod; }
inline ll expo(ll x, ll y) {
ll ans = 1;
while (y) {
if (y & 1)
ans = mul(ans, x);
x = mul(x, x);
y >>= 1;
}
return ans % mod;
}
inline ll inv(ll x) { return expo(x, mod - 2); }
/*/-----------------------------CODE BEGINS----------------------------------/*/
ll rr[] = {0, 1, 1, 1, 0, -1, -1, -1};
ll cc[] = {1, 1, 0, -1, -1, -1, 0, 1};
ll n, m, k, x, q, a[MAXN], b[MAXN], a1[MAXN];
void solve() {
cin >> n;
for (ll i = 1; i <= n; i++)
cin >> a[i];
vector<vector<ll>> dp(n + 1, vector<ll>(n + 1, 0));
for (ll l = n; l >= 1; l--) {
for (ll r = l; r <= n; r++) {
if (l == r)
dp[l][r] = a[l];
else
dp[l][r] = max(a[l] - dp[l + 1][r], a[r] - dp[l][r - 1]);
}
}
cout << dp[1][n];
}
signed main() {
bolt;
// #ifndef ONLINE_JUDGE
// djokovic;
// #endif
ll t;
t = 1;
// cin >> t;
while (t--) {
solve();
}
// rtime();
}
| [
"call.arguments.change"
] | 979,457 | 979,458 | u104653385 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
vector<int> A(n), pre(n);
for (int i = 0; i < n; i++)
cin >> A[i];
for (int i = 0; i < n; i++)
pre[i] = (i == 0 ? A[i] : pre[i - 1] + A[i]);
int sum = 0;
for (int x : A)
sum += x;
vector<vector<int>> dp(n, vector<int>(n, 0));
for (int l = n - 1; l >= 0; l--) {
for (int r = l; r < n; r++) {
if (l == r)
dp[l][r] = A[l];
else
dp[l][r] = (pre[r] - pre[l] + A[l]) - min(dp[l + 1][r], dp[l][r - 1]);
}
}
cout << 2 * dp[0][n - 1] - sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
vector<ll> A(n), pre(n);
for (int i = 0; i < n; i++)
cin >> A[i];
for (int i = 0; i < n; i++)
pre[i] = (i == 0 ? A[i] : pre[i - 1] + A[i]);
ll sum = 0;
for (int x : A)
sum += x;
vector<vector<ll>> dp(n, vector<ll>(n, 0));
for (int l = n - 1; l >= 0; l--) {
for (int r = l; r < n; r++) {
if (l == r)
dp[l][r] = A[l];
else
dp[l][r] = (pre[r] - pre[l] + A[l]) - min(dp[l + 1][r], dp[l][r - 1]);
}
}
cout << 2 * dp[0][n - 1] - sum << endl;
} | [
"variable_declaration.type.change",
"call.arguments.change"
] | 979,463 | 979,464 | u155258214 | cpp |
p03171 | /// problem link: http://lightoj.com/volume_showproblem.php?problem=1031
/// topic: dp
#include <bits/stdc++.h>
using namespace std;
#define INF 1 << 30
#define endl '\n'
#define maxn 100005
#define tc printf("Case %d: ", cs)
#define tcn printf("Case %d:\n", cs);
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long ll;
const double PI = acos(-1.0);
#define dbg1(x) cerr << #x << " = " << x << endl;
#define dbg2(x, y) cerr << #x << " = " << x << ", " << #y << " = " << y << endl;
#define dbg3(x, y, z) \
cerr << #x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " \
<< z << endl;
#define dbg4(w, x, y, z) \
cerr << #w << " = " << w << ", " << #x << " = " << x << ", " << #y << " = " \
<< y << ", " << #z << " = " << z << endl;
ll dp[3005][3005];
ll a[3005];
ll calc(ll l, ll r) {
if (l > r)
return 0;
ll &ret = dp[l][r];
if (ret != -1)
return ret;
ll sm = 0;
ll dif = INT_MIN;
// for (ll i = l; i <= r; i++) {
sm += a[l];
dif = max(dif, sm - calc(l + 1, r));
//}
sm = 0;
// for (ll i = r; i >= l; i--) {
sm += a[r];
dif = max(dif, sm - calc(l, r - 1));
//}
return ret = dif;
}
int main() {
// FASTIO
/*
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
//*/
ll T;
// scanf("%d", &T);
T = 1;
for (ll cs = 1; cs <= T; cs++) {
ll n;
scanf("%lld", &n);
for (ll i = 0; i < n; i++)
scanf("%lld", &a[i]);
memset(dp, -1, sizeof dp);
printf("%lld\n", calc(0, n - 1ll));
}
return 0;
} | /// problem link: http://lightoj.com/volume_showproblem.php?problem=1031
/// topic: dp
#include <bits/stdc++.h>
using namespace std;
#define INF 1 << 30
#define endl '\n'
#define maxn 100005
#define tc printf("Case %d: ", cs)
#define tcn printf("Case %d:\n", cs);
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long ll;
const double PI = acos(-1.0);
#define dbg1(x) cerr << #x << " = " << x << endl;
#define dbg2(x, y) cerr << #x << " = " << x << ", " << #y << " = " << y << endl;
#define dbg3(x, y, z) \
cerr << #x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " \
<< z << endl;
#define dbg4(w, x, y, z) \
cerr << #w << " = " << w << ", " << #x << " = " << x << ", " << #y << " = " \
<< y << ", " << #z << " = " << z << endl;
ll dp[3005][3005];
ll a[3005];
ll calc(ll l, ll r) {
if (l > r)
return 0;
ll &ret = dp[l][r];
if (ret != -1)
return ret;
ll sm = 0;
ll dif = -1e18;
// for (ll i = l; i <= r; i++) {
sm += a[l];
dif = max(dif, sm - calc(l + 1, r));
//}
sm = 0;
// for (ll i = r; i >= l; i--) {
sm += a[r];
dif = max(dif, sm - calc(l, r - 1));
//}
return ret = dif;
}
int main() {
// FASTIO
/*
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
//*/
ll T;
// scanf("%d", &T);
T = 1;
for (ll cs = 1; cs <= T; cs++) {
ll n;
scanf("%lld", &n);
for (ll i = 0; i < n; i++)
scanf("%lld", &a[i]);
memset(dp, -1, sizeof dp);
printf("%lld\n", calc(0, n - 1ll));
}
return 0;
} | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 979,465 | 979,466 | u802237789 | cpp |
p03171 | #pragma region
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, a, n) for (long long i = a; i <= n; ++i)
#define per(i, a, n) for (long long i = n; i >= a; --i)
#define IO ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
using namespace std;
/*
* __----~~~~~~~~~~~------___
* . . ~~//====...... __--~ ~~
* -. \_|// |||\\ ~~~~~~::::... /~
* ___-==_ _-~o~ \/ ||| \\ _/~~-
* __---~~~.==~||\=_ -_--~/_-~|- |\\ \\ _/~
* _-~~ .=~ | \\-_ '-~7 /- / || \ /
* .~ .~ | \\ -_ / /- / || \ /
* / ____ / | \\ ~-_/ /|- _/ .|| \ /
* |~~ ~~|--~~~~--_ \ ~==-/ | \~--===~~ .\
* ' ~-| /| |-~\~~ __--~~
* |-~~-_/ | | ~\_ _-~ /\
* / \ \__ \/~ \__
* _--~ _/ | .-~~____--~-/ ~~==.
* ((->/~ '.|||' -_| ~~-/ , . _||
* -_ ~\ ~~---l__i__i__i--~~_/
* _-~-__ ~) \--______________--~~
* //.-~~~-~_--~- |-------~~~~~~~~
* //.-~~~--\
* ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
*/
#pragma endregion
const int maxn = 3005;
ll a[maxn], dp[maxn][maxn];
int main() {
IO;
int n;
cin >> n;
rep(i, 1, n) cin >> a[i];
per(l, 1, n) per(r, l, n) dp[l][r] =
max(a[l] - dp[l + 1][r], a[r] - dp[l][r - 1]);
cout << dp[1][n] << endl;
} | #pragma region
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, a, n) for (long long i = a; i <= n; ++i)
#define per(i, a, n) for (long long i = n; i >= a; --i)
#define IO ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
using namespace std;
/*
* __----~~~~~~~~~~~------___
* . . ~~//====...... __--~ ~~
* -. \_|// |||\\ ~~~~~~::::... /~
* ___-==_ _-~o~ \/ ||| \\ _/~~-
* __---~~~.==~||\=_ -_--~/_-~|- |\\ \\ _/~
* _-~~ .=~ | \\-_ '-~7 /- / || \ /
* .~ .~ | \\ -_ / /- / || \ /
* / ____ / | \\ ~-_/ /|- _/ .|| \ /
* |~~ ~~|--~~~~--_ \ ~==-/ | \~--===~~ .\
* ' ~-| /| |-~\~~ __--~~
* |-~~-_/ | | ~\_ _-~ /\
* / \ \__ \/~ \__
* _--~ _/ | .-~~____--~-/ ~~==.
* ((->/~ '.|||' -_| ~~-/ , . _||
* -_ ~\ ~~---l__i__i__i--~~_/
* _-~-__ ~) \--______________--~~
* //.-~~~-~_--~- |-------~~~~~~~~
* //.-~~~--\
* ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
*/
#pragma endregion
const int maxn = 3005;
ll a[maxn], dp[maxn][maxn];
int main() {
IO;
int n;
cin >> n;
rep(i, 1, n) cin >> a[i];
per(l, 1, n) rep(r, l, n) dp[l][r] =
max(a[l] - dp[l + 1][r], a[r] - dp[l][r - 1]);
cout << dp[1][n] << endl;
} | [
"assignment.variable.change",
"identifier.change",
"call.function.change"
] | 979,477 | 979,478 | u035226457 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
long long int dp[3001][3001];
vector<ll> v;
int solve(int i, int j) {
if (dp[i][j] != -1) {
return dp[i][j];
}
if (i > j) {
return 0;
}
if (i == j) {
return v[i];
}
if (j == i + 1) {
return max(v[i], v[j]);
}
long long int ans = max(v[i] + min(solve(i + 2, j), solve(i + 1, j - 1)),
v[j] + min(solve(i + 1, j - 1), solve(i, j - 2)));
return dp[i][j] = ans;
}
int main() {
int n;
cin >> n;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
dp[i][j] = -1;
}
}
ll totalsum = 0;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
totalsum += x;
v.push_back(x);
}
ll X = solve(0, v.size() - 1);
ll Y = totalsum - X;
cout << X - Y;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
long long int dp[3001][3001];
vector<ll> v;
ll solve(int i, int j) {
if (dp[i][j] != -1) {
return dp[i][j];
}
if (i > j) {
return 0;
}
if (i == j) {
return v[i];
}
if (j == i + 1) {
return max(v[i], v[j]);
}
long long int ans = max(v[i] + min(solve(i + 2, j), solve(i + 1, j - 1)),
v[j] + min(solve(i + 1, j - 1), solve(i, j - 2)));
return dp[i][j] = ans;
}
int main() {
int n;
cin >> n;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
dp[i][j] = -1;
}
}
ll totalsum = 0;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
totalsum += x;
v.push_back(x);
}
ll X = solve(0, v.size() - 1);
ll Y = totalsum - X;
cout << X - Y;
}
| [] | 979,479 | 979,480 | u348267046 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define mod 1000000007
#define dbg(n) cout << #n << ' ' << n << endl;
ll dp[101][101];
ll solve(int i, int j, ll a[]) {
if (i == j)
return dp[i][j] = a[i];
else if (j == i + 1)
return dp[i][j] = max(a[i], a[j]);
else if (dp[i][j] != -1)
return dp[i][j];
return dp[i][j] = max(a[i] + min(solve(i + 2, j, a), solve(i + 1, j - 1, a)),
a[j] + min(solve(i, j - 2, a), solve(i + 1, j - 1, a)));
}
int main() {
for (int i = 0; i < 101; i++)
for (int j = 0; j < 101; j++)
dp[i][j] = 0;
int n;
cin >> n;
ll a[n];
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
ll mx = solve(0, n - 1, a);
ll ans = 2 * mx - sum;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define mod 1000000007
#define dbg(n) cout << #n << ' ' << n << endl;
ll dp[3001][3001];
ll solve(int i, int j, ll a[]) {
if (i == j)
return dp[i][j] = a[i];
else if (j == i + 1)
return dp[i][j] = max(a[i], a[j]);
else if (dp[i][j] != -1)
return dp[i][j];
return dp[i][j] = max(a[i] + min(solve(i + 2, j, a), solve(i + 1, j - 1, a)),
a[j] + min(solve(i, j - 2, a), solve(i + 1, j - 1, a)));
}
int main() {
for (int i = 0; i < 3001; i++)
for (int j = 0; j < 3001; j++)
dp[i][j] = -1;
int n;
cin >> n;
ll a[n];
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
ll mx = solve(0, n - 1, a);
ll ans = 2 * mx - sum;
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 979,485 | 979,484 | u486906248 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define mod 1000000007
#define dbg(n) cout << #n << ' ' << n << endl;
ll dp[101][101];
ll solve(int i, int j, ll a[]) {
if (i == j)
return dp[i][j] = a[i];
else if (j == i + 1)
return dp[i][j] = max(a[i], a[j]);
else if (dp[i][j] != -1)
return dp[i][j];
return dp[i][j] = max(a[i] + min(solve(i + 2, j, a), solve(i + 1, j - 1, a)),
a[j] + min(solve(i, j - 2, a), solve(i + 1, j - 1, a)));
}
int main() {
for (int i = 0; i < 101; i++)
for (int j = 0; j < 101; j++)
dp[i][j] = 0;
int n;
cin >> n;
ll a[n];
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
ll mx = solve(0, n - 1, a);
ll ans = 2 * mx - sum;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define mod 1000000007
#define dbg(n) cout << #n << ' ' << n << endl;
ll dp[3001][3001];
ll solve(int i, int j, ll a[]) {
if (i == j)
return dp[i][j] = a[i];
else if (j == i + 1)
return dp[i][j] = max(a[i], a[j]);
else if (dp[i][j] != 0)
return dp[i][j];
return dp[i][j] = max(a[i] + min(solve(i + 2, j, a), solve(i + 1, j - 1, a)),
a[j] + min(solve(i, j - 2, a), solve(i + 1, j - 1, a)));
}
int main() {
for (int i = 0; i < 101; i++)
for (int j = 0; j < 101; j++)
dp[i][j] = 0;
int n;
cin >> n;
ll a[n];
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
ll mx = solve(0, n - 1, a);
ll ans = 2 * mx - sum;
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.branch.if.condition.change"
] | 979,485 | 979,488 | u486906248 | cpp |
p03171 | ///...................................*****.................................................///
/// Mujahidul Islam ( mujahidulislam2923@gmail.com ) ///
/// Department of Ict /// Comilla University , Bangladesh. ///
///...................................*****.................................................///
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using orderset =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define FaRaBi \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define ll long long int
#define ld long double
#define ull unsigned long long int
#define pii pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define sc scanf
#define pf printf
#define scin(x) scanf("%d", &(x))
#define scin2(x, y) scanf("%d %d", &(x), &(y))
#define scin3(x, y, z) scanf("%d %d %d", &(x), &(y), &(z))
#define scln(x) scanf("%lld", &(x))
#define scln2(x, y) scanf("%lld %lld", &(x), &(y))
#define scln3(x, y, z) scanf("%lld %lld %lld", &(x), &(y), &(z))
#define min3(a, b, c) min(a, min(b, c))
#define min4(a, b, c, d) min(d, min(a, min(b, c)))
#define max3(a, b, c) max(a, max(b, c))
#define max4(a, b, c, d) max(d, max(a, max(b, c)))
#define ms(a, b) memset(a, b, sizeof(a))
#define mp make_pair
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a) * (b) / gcd(a, b))
#define input freopen("input.txt", "rt", stdin)
#define output freopen("output.txt", "wt", stdout)
#define PI acos(-1.0)
#define zero(a) memset(a, 0, sizeof a)
#define all(v) v.begin(), v.end()
#define Max(v) *max_element(all(v))
#define Min(v) *min_element(all(v))
#define Upper(c, x) (upper_bound(c.begin(), c.end(), x) - c.begin())
#define Lower(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define Unique(X) (X).erase(unique(all(X)), (X).end())
#define no cout << "NO" << endl;
#define yes cout << "YES" << endl;
#define segment_tree \
int Lnode = node << 1, Rnode = Lnode + 1, mid = (b + e) >> 1;
/// cout << fixed << setprecision( 9 ) << n << endl ;
/// sum accumulate( v.begin(), v.begin() + k, 0LL )///bool operator < ( const
/// Node& p ) const{ return cost < p.cost ; }
/// priority_queue<int,vector<int>,greater<int> >pq;///std::set<ll,
/// std::greater<ll> > Set;///string str = "abcdefghijklmnopqrstuvwxyz";///string
/// s2 = "ABCDEFGHIJKLMNOPQRSTUVWXYZ" ; string s = bitset<64>( n ).to_string() ;
/// ll val = bitset< 64 >( s ).to_ullong() ;
///--------------Graph Moves--------------------------------------
/// const int fx[] = {+1,-1,+0,+0}; ///const int fy[] = {+0,+0,+1,-1};
/// const int fx[] = {+0,+0,+1,-1,-1,+1,-1,+1}; ///King's move ///const int fy[]
/// = {-1,+1,+0,+0,+1,+1,-1,-1}; ///king's Move const int fx[] =
/// {-2,-2,-1,-1,+1,+1,+2,+2}; ///knight's move ///const int fy[] =
/// {-1,+1,-2,+2,-2,+2,-1,+1}; ///knight's move
///---------------------------------------------------------------
///--------------------**********----------------------------------
vector<ll> v(3005), v1, v2, v3, v4;
vector<pair<ll, ll>> vec1, vec2;
vector<pll> vec;
vector<ll> adj[100005];
map<ll, ll> Mp, Mp1, Mp2;
set<ll> st1, st2;
queue<ll> Q;
stack<ll> Stk;
multiset<ll> S;
///---------------------**********--------------------------------
#define INF 1e15
ll n;
ll dp[3005][3005];
void Reset() {
for (int i = 0; i <= 3001; i++) {
for (int j = 0; j <= 3001; j++) {
dp[i][j] = INF;
}
}
}
void Input() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
}
ll Fun(int L, int R, int ck) {
if (dp[L][R] != INF)
return dp[L][R];
if (L == R)
return 0;
if (R - L == 1) {
if (ck)
return v[L];
else
return -v[L];
}
ll val = 0;
if (ck)
val = max(Fun(L + 1, R, 0) + v[L], Fun(L, R - 1, 0) + v[R - 1]);
else
val = min(Fun(L + 1, R, 1) - v[L], Fun(L, R - 1, 1) - v[R - 1]);
return dp[L][R] = val;
}
void Calculation() {
ll ans = Fun(1, n, 1);
cout << ans << endl;
}
void solve() {
Reset();
Input();
Calculation();
}
int main() {
FaRaBi;
int t;
// cin >> t ;
t = 1;
while (t--) {
solve();
}
return 0;
}
| ///...................................*****.................................................///
/// Mujahidul Islam ( mujahidulislam2923@gmail.com ) ///
/// Department of Ict /// Comilla University , Bangladesh. ///
///...................................*****.................................................///
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using orderset =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define FaRaBi \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define ll long long int
#define ld long double
#define ull unsigned long long int
#define pii pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define sc scanf
#define pf printf
#define scin(x) scanf("%d", &(x))
#define scin2(x, y) scanf("%d %d", &(x), &(y))
#define scin3(x, y, z) scanf("%d %d %d", &(x), &(y), &(z))
#define scln(x) scanf("%lld", &(x))
#define scln2(x, y) scanf("%lld %lld", &(x), &(y))
#define scln3(x, y, z) scanf("%lld %lld %lld", &(x), &(y), &(z))
#define min3(a, b, c) min(a, min(b, c))
#define min4(a, b, c, d) min(d, min(a, min(b, c)))
#define max3(a, b, c) max(a, max(b, c))
#define max4(a, b, c, d) max(d, max(a, max(b, c)))
#define ms(a, b) memset(a, b, sizeof(a))
#define mp make_pair
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a) * (b) / gcd(a, b))
#define input freopen("input.txt", "rt", stdin)
#define output freopen("output.txt", "wt", stdout)
#define PI acos(-1.0)
#define zero(a) memset(a, 0, sizeof a)
#define all(v) v.begin(), v.end()
#define Max(v) *max_element(all(v))
#define Min(v) *min_element(all(v))
#define Upper(c, x) (upper_bound(c.begin(), c.end(), x) - c.begin())
#define Lower(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define Unique(X) (X).erase(unique(all(X)), (X).end())
#define no cout << "NO" << endl;
#define yes cout << "YES" << endl;
#define segment_tree \
int Lnode = node << 1, Rnode = Lnode + 1, mid = (b + e) >> 1;
/// cout << fixed << setprecision( 9 ) << n << endl ;
/// sum accumulate( v.begin(), v.begin() + k, 0LL )///bool operator < ( const
/// Node& p ) const{ return cost < p.cost ; }
/// priority_queue<int,vector<int>,greater<int> >pq;///std::set<ll,
/// std::greater<ll> > Set;///string str = "abcdefghijklmnopqrstuvwxyz";///string
/// s2 = "ABCDEFGHIJKLMNOPQRSTUVWXYZ" ; string s = bitset<64>( n ).to_string() ;
/// ll val = bitset< 64 >( s ).to_ullong() ;
///--------------Graph Moves--------------------------------------
/// const int fx[] = {+1,-1,+0,+0}; ///const int fy[] = {+0,+0,+1,-1};
/// const int fx[] = {+0,+0,+1,-1,-1,+1,-1,+1}; ///King's move ///const int fy[]
/// = {-1,+1,+0,+0,+1,+1,-1,-1}; ///king's Move const int fx[] =
/// {-2,-2,-1,-1,+1,+1,+2,+2}; ///knight's move ///const int fy[] =
/// {-1,+1,-2,+2,-2,+2,-1,+1}; ///knight's move
///---------------------------------------------------------------
///--------------------**********----------------------------------
vector<ll> v(3005), v1, v2, v3, v4;
vector<pair<ll, ll>> vec1, vec2;
vector<pll> vec;
vector<ll> adj[100005];
map<ll, ll> Mp, Mp1, Mp2;
set<ll> st1, st2;
queue<ll> Q;
stack<ll> Stk;
multiset<ll> S;
///---------------------**********--------------------------------
#define INF 1e15
ll n;
ll dp[3005][3005];
void Reset() {
for (int i = 0; i <= 3001; i++) {
for (int j = 0; j <= 3001; j++) {
dp[i][j] = INF;
}
}
}
void Input() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
}
ll Fun(int L, int R, int ck) {
if (dp[L][R] != INF)
return dp[L][R];
if (L == R)
return 0;
if (R - L == 1) {
if (ck)
return v[L];
else
return -v[L];
}
ll val = 0;
if (ck)
val = max(Fun(L + 1, R, 0) + v[L], Fun(L, R - 1, 0) + v[R - 1]);
else
val = min(Fun(L + 1, R, 1) - v[L], Fun(L, R - 1, 1) - v[R - 1]);
return dp[L][R] = val;
}
void Calculation() {
ll ans = Fun(1, n + 1, 1);
cout << ans << endl;
}
void solve() {
Reset();
Input();
Calculation();
}
int main() {
FaRaBi;
int t;
// cin >> t ;
t = 1;
while (t--) {
solve();
}
return 0;
}
| [
"assignment.change"
] | 979,491 | 979,492 | u191752096 | cpp |
p03171 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <stack>
#include <vector>
#define int long long
using namespace std;
int32_t main() {
int N;
cin >> N;
vector<int> arr(N);
for (int &e : arr)
cin >> e;
vector<vector<int>> dp(N + 1, vector<int>(N + 1));
for (int len = 1; len <= N; len++) {
for (int l = 0; l + len <= N; l++) {
int r = l + len;
dp[l][r] = -2e18;
dp[l][r] = max(dp[l][r], arr[l] - dp[l + 1][r]);
dp[l][r] = max(dp[l][r], arr[r] - dp[l][r - 1]);
}
}
cout << dp[0][N] << endl;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <stack>
#include <vector>
#define int long long
using namespace std;
int32_t main() {
int N;
cin >> N;
vector<int> arr(N);
for (int &e : arr)
cin >> e;
vector<vector<int>> dp(N + 1, vector<int>(N + 1));
for (int len = 1; len <= N; len++) {
for (int l = 0; l + len <= N; l++) {
int r = l + len;
dp[l][r] = -2e18;
dp[l][r] = max(dp[l][r], arr[l] - dp[l + 1][r]);
dp[l][r] = max(dp[l][r], arr[r - 1] - dp[l][r - 1]);
}
}
cout << dp[0][N] << endl;
} | [
"assignment.change"
] | 979,495 | 979,496 | u869736844 | cpp |
p03171 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <stack>
#include <vector>
#define int long long
using namespace std;
int32_t main() {
int N;
cin >> N;
vector<int> arr(N);
for (int &e : arr)
cin >> e;
vector<vector<int>> dp(N, vector<int>(N + 1));
for (int len = 1; len <= N; len++) {
for (int l = 0; l + len <= N; l++) {
int r = l + len;
dp[l][r] = -2e18;
dp[l][r] = max(dp[l][r], arr[l] - dp[l + 1][r]);
dp[l][r] = max(dp[l][r], arr[r] - dp[l][r - 1]);
}
}
cout << dp[0][N] << endl;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <stack>
#include <vector>
#define int long long
using namespace std;
int32_t main() {
int N;
cin >> N;
vector<int> arr(N);
for (int &e : arr)
cin >> e;
vector<vector<int>> dp(N + 1, vector<int>(N + 1));
for (int len = 1; len <= N; len++) {
for (int l = 0; l + len <= N; l++) {
int r = l + len;
dp[l][r] = -2e18;
dp[l][r] = max(dp[l][r], arr[l] - dp[l + 1][r]);
dp[l][r] = max(dp[l][r], arr[r - 1] - dp[l][r - 1]);
}
}
cout << dp[0][N] << endl;
} | [
"assignment.change"
] | 979,497 | 979,496 | u869736844 | cpp |
p03171 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <stack>
#include <vector>
#define int long long
using namespace std;
int32_t main() {
int N;
cin >> N;
vector<int> arr(N);
for (int &e : arr)
cin >> e;
vector<vector<int>> dp(N, vector<int>(N + 1));
for (int len = 2; len <= N; len++) {
for (int l = 0; l + len <= N; l++) {
int r = l + len;
dp[l][r] = -2e18;
dp[l][r] = max(dp[l][r], arr[l] - dp[l + 1][r]);
dp[l][r] = max(dp[l][r], arr[r] - dp[l][r - 1]);
}
}
cout << dp[0][N] << endl;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <stack>
#include <vector>
#define int long long
using namespace std;
int32_t main() {
int N;
cin >> N;
vector<int> arr(N);
for (int &e : arr)
cin >> e;
vector<vector<int>> dp(N + 1, vector<int>(N + 1));
for (int len = 1; len <= N; len++) {
for (int l = 0; l + len <= N; l++) {
int r = l + len;
dp[l][r] = -2e18;
dp[l][r] = max(dp[l][r], arr[l] - dp[l + 1][r]);
dp[l][r] = max(dp[l][r], arr[r - 1] - dp[l][r - 1]);
}
}
cout << dp[0][N] << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.change"
] | 979,498 | 979,496 | u869736844 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 3005;
int64_t dp[MAX][MAX];
vector<int> vals(MAX, 0);
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> vals[i];
for (int L = n - 1; L >= 0; L--) {
for (int R = L; R < n; R++) {
if (L == R) {
dp[L][R] = max(vals[L] - dp[L + 1][R], vals[R] - dp[L][R - 1]);
} else {
dp[L][R] = vals[L];
}
}
}
cout << dp[0][n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int MAX = 3005;
int64_t dp[MAX][MAX];
vector<int> vals(MAX, 0);
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> vals[i];
for (int L = n - 1; L >= 0; L--) {
for (int R = L; R < n; R++) {
if (L != R) {
dp[L][R] = max(vals[L] - dp[L + 1][R], vals[R] - dp[L][R - 1]);
} else {
dp[L][R] = vals[L];
}
}
}
cout << dp[0][n - 1];
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 979,499 | 979,500 | u479813076 | cpp |
p03171 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <vector>
#define fast ios_base::sync_with_stdio(false)
#define mxn (ll)1e5
#define mod (ll)(1e9 + 7)
#define mod1 (ll)(998244353)
#define ll long long int
#define ld long double
#define vi vector<ll>
#define vvi vector<vi>
#define pi pair<ll, ll>
#define vvpi vector<vector<pi>>
#define vpi vector<pi>
#define vppi vector<pair<ll, pi>>
#define vs vector<string>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define eb emplace_back
#define mkp make_pair
#define fs first
#define se second
#define crz(v, n) v.clear(), v.resize(n + 1, 0)
#define print(v) \
for (ll it = 0; it < v.size(); it++) \
cout << v[it] << " "; \
cout << endl
#define printp(v) \
for (ll it = 0; it < v.size(); it++) \
cout << v[it].first << " " << v[it].second << endl
using namespace std;
int main() {
int i, j, n;
ll s = 0;
cin >> n;
vi v(n);
for (i = 0; i < n; i++)
cin >> v[i], s += v[i];
vvpi d(n + 1, vpi(n + 1));
for (i = 1; i <= n; i++)
d[i][i].fs = v[i - 1], d[i][i].se = 0;
for (i = 1; i < n; i++) {
for (j = 1; j <= n - i; j++) {
int a = j, b = i + j;
d[a][b].fs = max(v[a - 1] + d[a + 1][b].se, v[b - 1] + d[a][b - 1].se);
if (v[a - 1] + d[a + 1][b].se > v[b - 1] + d[a][b - 1].se)
d[a][b].se = d[a + 1][b].fs;
else
d[a][b].se = d[a][b - 1].fs;
}
}
cout << s - 2 * d[1][n].fs << endl;
// for(i=1;i<=n;i++){
// for(j=1;j<=n;j++) cout<<d[i][j].fs<<" "<<d[i][j].se<<"
//";cout<<endl;
// }
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <vector>
#define fast ios_base::sync_with_stdio(false)
#define mxn (ll)1e5
#define mod (ll)(1e9 + 7)
#define mod1 (ll)(998244353)
#define ll long long int
#define ld long double
#define vi vector<ll>
#define vvi vector<vi>
#define pi pair<ll, ll>
#define vvpi vector<vector<pi>>
#define vpi vector<pi>
#define vppi vector<pair<ll, pi>>
#define vs vector<string>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define eb emplace_back
#define mkp make_pair
#define fs first
#define se second
#define crz(v, n) v.clear(), v.resize(n + 1, 0)
#define print(v) \
for (ll it = 0; it < v.size(); it++) \
cout << v[it] << " "; \
cout << endl
#define printp(v) \
for (ll it = 0; it < v.size(); it++) \
cout << v[it].first << " " << v[it].second << endl
using namespace std;
int main() {
int i, j, n;
ll s = 0;
cin >> n;
vi v(n);
for (i = 0; i < n; i++)
cin >> v[i], s += v[i];
vvpi d(n + 1, vpi(n + 1));
for (i = 1; i <= n; i++)
d[i][i].fs = v[i - 1], d[i][i].se = 0;
for (i = 1; i < n; i++) {
for (j = 1; j <= n - i; j++) {
int a = j, b = i + j;
d[a][b].fs = max(v[a - 1] + d[a + 1][b].se, v[b - 1] + d[a][b - 1].se);
if (v[a - 1] + d[a + 1][b].se > v[b - 1] + d[a][b - 1].se)
d[a][b].se = d[a + 1][b].fs;
else
d[a][b].se = d[a][b - 1].fs;
}
}
cout << 2 * d[1][n].fs - s << endl;
// for(i=1;i<=n;i++){
// for(j=1;j<=n;j++) cout<<d[i][j].fs<<" "<<d[i][j].se<<"
//";cout<<endl;
// }
}
| [
"expression.operation.binary.remove"
] | 979,503 | 979,504 | u163525690 | cpp |
p03171 | #include <stdio.h>
long long int max(long long int a, long long int b) {
if (a > b)
return a;
return b;
}
long long int min(long long int a, long long int b) {
if (a < b)
return a;
return b;
}
long long int dp[3002][3002];
long long int D(long long int d[], int l, int r) {
if (dp[l][r] > 0)
return dp[l][r];
if (l < r)
dp[l][r] = max(d[l] + min(D(d, l + 1, r - 1), D(d, l + 2, r)),
d[r] + min(D(d, l, r - 2), D(d, l + 1, r - 1)));
if (l == r)
dp[l][r] = d[l];
else
dp[l][r] = 0;
return dp[l][r];
}
long long int d[3002];
int main() {
long long int n;
long long int sum = 0;
scanf("%lld", &n);
for (int i = 0; i < n; i++) {
scanf("%lld", &d[i]);
sum += d[i];
}
// if(D(d,0,n-1)<sum-D(d,0,n-1)) printf("2\n%lld\n",sum-D(d,0,n-1));
printf("%lld\n", 2 * D(d, 0, n - 1) - sum);
return 0;
}
| #include <stdio.h>
long long int max(long long int a, long long int b) {
if (a > b)
return a;
return b;
}
long long int min(long long int a, long long int b) {
if (a < b)
return a;
return b;
}
long long int dp[3002][3002];
long long int D(long long int d[], int l, int r) {
if (dp[l][r] > 0)
return dp[l][r];
if (l < r)
dp[l][r] = max(d[l] + min(D(d, l + 1, r - 1), D(d, l + 2, r)),
d[r] + min(D(d, l, r - 2), D(d, l + 1, r - 1)));
else if (l == r)
dp[l][r] = d[l];
else
dp[l][r] = 0;
return dp[l][r];
}
long long int d[3002];
int main() {
long long int n;
long long int sum = 0;
scanf("%lld", &n);
for (int i = 0; i < n; i++) {
scanf("%lld", &d[i]);
sum += d[i];
}
// if(D(d,0,n-1)<sum-D(d,0,n-1)) printf("2\n%lld\n",sum-D(d,0,n-1));
printf("%lld\n", 2 * D(d, 0, n - 1) - sum);
return 0;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 979,514 | 979,515 | u681396939 | cpp |
p03171 | // Harjot Singh Student NIT JALANDHAR
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long long int ll;
ll dp[3001][3001][2];
ll solve(ll *arr, int i, int j, int state) {
if (i > j)
return 0;
if (dp[i][j][state] != -1)
return dp[i][j][state];
if (state == 1)
return dp[i][j][state] = max(arr[i] + solve(arr, i + 1, j, 0),
arr[j] + solve(arr, i, j - 1, 0));
return dp[i][j][state] =
min(solve(arr, i + 1, j, 1), solve(arr, i, j - 1, 1));
}
int main() {
ll n;
cin >> n;
ll arr[n + 1];
int sum = 0;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
sum += arr[i];
}
memset(dp, -1, sizeof(dp));
ll x = solve(arr, 1, n, 1);
ll y = sum - x;
cout << x - y << endl;
return 0;
} | // Harjot Singh Student NIT JALANDHAR
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long long int ll;
ll dp[3001][3001][2];
ll solve(ll *arr, int i, int j, int state) {
if (i > j)
return 0;
if (dp[i][j][state] != -1)
return dp[i][j][state];
if (state == 1)
return dp[i][j][state] = max(arr[i] + solve(arr, i + 1, j, 0),
arr[j] + solve(arr, i, j - 1, 0));
else
return dp[i][j][state] =
min(solve(arr, i + 1, j, 1), solve(arr, i, j - 1, 1));
}
int main() {
int n;
cin >> n;
ll arr[n + 1];
ll sum = 0;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
sum += arr[i];
}
memset(dp, -1, sizeof(dp));
ll x = solve(arr, 1, n, 1);
ll y = sum - x;
cout << x - y << endl;
return 0;
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"variable_declaration.type.change"
] | 979,518 | 979,519 | u487912105 | cpp |
p03171 | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep_1 (i, j, n) for (int i = j; i < n; i++)
typedef long long ll;
typedef long l;
const ll l_INF = 101010101000;
const int INF = 1010101010;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
int dp[3010][3010];
int n;
vi a(3010);
/*int f(int x, int y){
if(dp[x][y]!=0) return dp[x][y];
if((n-x+y)%2==0){
if(x-1>=0&&y+1<n) return dp[x][y] = max(f(x-1,y)+a[x-1],f(x,y+1)+a[y+1]);
else if(x-1>=0) return dp[x][y] = f(x-1,y)+a[x-1];
else return dp[x][y] = f(x,y+1)+a[y+1];
}else{
if(x-1>=0&&y+1<n) return dp[x][y] = min(f(x-1,y)-a[x-1],f(x,y+1)-a[y+1]);
else if(x-1>=0) return dp[x][y] = f(x-1,y)-a[x-1];
else return dp[x][y] = f(x,y+1)-a[y+1];
}
}*/
int main() {
cin >> n;
rep(i, n) cin >> a[i];
rep(i, n) {
rep(j, n) { dp[i][j] = 0; }
}
for (int l = 1; l <= n; l++) {
for (int i = 0; i <= n - l; i++) {
if ((n - l) % 2 == 0)
dp[i][i + l] =
max(dp[i][i + l - 1] + a[i + l - 1], dp[i + 1][i + l] + a[i]);
if ((n - l) % 2 == 1)
dp[i][i + l] =
min(dp[i][i + l - 1] - a[i + l - 1], dp[i + 1][i + l] - a[i]);
}
}
cout << dp[0][n];
} | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep_1 (i, j, n) for (int i = j; i < n; i++)
typedef long long ll;
typedef long l;
const ll l_INF = 101010101000;
const int INF = 1010101010;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
ll dp[3010][3010];
int n;
vector<ll> a(3010);
int main() {
cin >> n;
rep(i, n) cin >> a[i];
rep(i, n) {
rep(j, n) { dp[i][j] = 0; }
}
for (int l = 1; l <= n; l++) {
for (int i = 0; i <= n - l; i++) {
if ((n - l) % 2 == 0)
dp[i][i + l] =
max(dp[i][i + l - 1] + a[i + l - 1], dp[i + 1][i + l] + a[i]);
if ((n - l) % 2 == 1)
dp[i][i + l] =
min(dp[i][i + l - 1] - a[i + l - 1], dp[i + 1][i + l] - a[i]);
}
}
cout << dp[0][n];
} | [
"variable_declaration.type.change"
] | 979,520 | 979,521 | u422725381 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vii = vector<vector<int>>;
using Graph = vector<vector<int>>;
const int INF = 1 << 30;
const ll INFL = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int N;
long long dp[3005][3005]; //---- dp[i][j]: a[i, j)を初期局面としたときのX-Y
int main() {
cin >> N;
vi a(N);
rep(i, N) cin >> a[i];
rep(i, N) dp[i][i] = 0; //---- 初期条件
for (int len = 1; len <= N; ++len) {
for (int i = 0; i < N; ++i) {
int j = len - i;
if ((N - len) % 2 == 0)
dp[i][j] = max(dp[i + 1][j] + a[i], dp[i][j - 1] + a[j - 1]);
else
dp[i][j] = min(dp[i + 1][j] - a[i], dp[i][j - 1] - a[j - 1]);
}
}
cout << dp[0][N];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vii = vector<vector<int>>;
using Graph = vector<vector<int>>;
const int INF = 1 << 30;
const ll INFL = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int N;
long long dp[3005][3005]; //---- dp[i][j]: a[i, j)を初期局面としたときのX-Y
int main() {
cin >> N;
vi a(N + 1);
rep(i, N) cin >> a[i];
rep(i, N) dp[i][i] = 0; //---- 初期条件
for (int len = 1; len <= N; ++len) {
for (int i = 0; i < N; ++i) {
int j = i + len;
//---- 先手番
if ((N - len) % 2 == 0)
dp[i][j] = max(dp[i + 1][j] + a[i], dp[i][j - 1] + a[j - 1]);
//---- 後手番
else
dp[i][j] = min(dp[i + 1][j] - a[i], dp[i][j - 1] - a[j - 1]);
}
}
cout << dp[0][N];
return 0;
} | [
"expression.operation.binary.remove"
] | 979,526 | 979,527 | u919510700 | cpp |
p03171 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using llong = long long;
using P = pair<int, int>;
const int inf = 1 << 20;
const int mod = 1e9 + 7;
bool flag[3005][3005];
llong dp[3005][3005];
int a[3005];
int f(int l, int r) {
if (flag[l][r])
return dp[l][r];
flag[l][r] = true;
if (l == r)
return dp[l][r] = a[l];
return dp[l][r] = max(a[l] - f(l + 1, r), a[r] - f(l, r - 1));
}
int main() {
int n;
cin >> n;
rep(i, 0, n) cin >> a[i];
cout << f(0, n - 1) << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using llong = long long;
using P = pair<int, int>;
const int inf = 1 << 20;
const int mod = 1e9 + 7;
bool flag[3005][3005];
llong dp[3005][3005];
int a[3005];
llong f(int l, int r) {
if (flag[l][r])
return dp[l][r];
flag[l][r] = true;
if (l == r)
return dp[l][r] = a[l];
return dp[l][r] = max(a[l] - f(l + 1, r), a[r] - f(l, r - 1));
}
int main() {
int n;
cin >> n;
rep(i, 0, n) cin >> a[i];
cout << f(0, n - 1) << endl;
return 0;
} | [] | 979,528 | 979,529 | u748577909 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
int n;
vector<int> arr(3025);
int dp[3033][3033][2];
int solve(int i, int j, int turn) {
if (i > j)
return 0;
if (dp[i][j][turn] != -1)
return dp[i][j][turn];
if (turn == 1)
return dp[i][j][turn] = max((arr[i] + solve(i + 1, j, 0)),
(arr[j] + solve(i, j - 1, 0)));
else
return dp[i][j][turn] = min(solve(i + 1, j, 1), solve(i, j - 1, 1));
}
int main(void) {
cin >> n;
int sum = 0;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
sum += arr[i];
}
memset(dp, -1, sizeof dp);
int ret = solve(1, n, 1);
sum -= ret;
cout << ret - sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
int n;
vector<int> arr(3025);
int dp[3033][3033][2];
int solve(int i, int j, int turn) {
if (i > j)
return 0;
if (dp[i][j][turn] != -1)
return dp[i][j][turn];
if (turn == 1)
return dp[i][j][turn] = max((arr[i] + solve(i + 1, j, 0)),
(arr[j] + solve(i, j - 1, 0)));
else
return dp[i][j][turn] = min(solve(i + 1, j, 1), solve(i, j - 1, 1));
}
signed main(void) {
cin >> n;
int sum = 0;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
sum += arr[i];
}
memset(dp, -1, sizeof dp);
int ret = solve(1, n, 1);
sum -= ret;
cout << ret - sum << endl;
} | [
"variable_declaration.type.primitive.change"
] | 979,530 | 979,531 | u043140820 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define pb push_back
#define mk make_pair
#define precise(x) cout << fixed << setprecision(12) << x
#define test cout << "#";
const ll INF = 1e18L + 5;
ll ans[3001][3001][2];
ll solve(vector<ll> &v, ll s, ll e, ll turn) {
if (s > e)
return 0;
if (ans[s][e][turn] != -1)
return ans[s][e][turn];
if (turn == 0)
return ans[s][e][turn] = min(solve(v, s + 1, e, 1), solve(v, s, e - 1, 1));
else
return ans[s][e][turn] =
max(solve(v, s + 1, e, 0) + v[s], solve(v, s, e - 1, 0) + v[e]);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<ll> v(n);
ll sum = 0;
for (ll x = 0; x < n; x++) {
cin >> v[x];
sum += v[x];
}
memset(ans, -1, sizeof(ans));
ll x = solve(v, 1, n, 1);
ll y = sum - x;
cout << x - y;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define pb push_back
#define mk make_pair
#define precise(x) cout << fixed << setprecision(12) << x
#define test cout << "#";
const ll INF = 1e18L + 5;
ll ans[3001][3001][2];
ll solve(vector<ll> &v, ll s, ll e, ll turn) {
if (s > e)
return 0;
if (ans[s][e][turn] != -1)
return ans[s][e][turn];
if (turn == 0)
return ans[s][e][turn] = min(solve(v, s + 1, e, 1), solve(v, s, e - 1, 1));
else
return ans[s][e][turn] = max(solve(v, s + 1, e, 0) + v[s - 1],
solve(v, s, e - 1, 0) + v[e - 1]);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<ll> v(n);
ll sum = 0;
for (ll x = 0; x < n; x++) {
cin >> v[x];
sum += v[x];
}
memset(ans, -1, sizeof(ans));
ll x = solve(v, 1, n, 1);
ll y = sum - x;
cout << x - y;
} | [
"assignment.change"
] | 979,532 | 979,533 | u466535000 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int arr[a + 50], dp[a + 50][a + 50];
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= a; i++) {
cin >> arr[i];
dp[i][i] = arr[i];
}
for (int i = 2; i <= a; i++) {
for (int j = 1; j + i - 1 <= a; j++) {
int l = j, r = j + i - 1;
dp[l][r] = max(arr[l] - dp[l + 1][r], arr[r] - dp[l][r - 1]);
}
}
cout << dp[1][a] << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long lli;
int main() {
int a;
cin >> a;
lli arr[a + 50], dp[a + 50][a + 50];
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= a; i++) {
cin >> arr[i];
dp[i][i] = arr[i];
}
for (int i = 2; i <= a; i++) {
for (int j = 1; j + i - 1 <= a; j++) {
int l = j, r = j + i - 1;
dp[l][r] = max(arr[l] - dp[l + 1][r], arr[r] - dp[l][r - 1]);
}
}
cout << dp[1][a] << '\n';
return 0;
} | [
"variable_declaration.type.change"
] | 979,535 | 979,536 | u073500051 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define f(i, x, y) for (int i = x; i < y; i++)
#define ll long long
#define mp make_pair
#define F first
#define S second
#define N 100005
#define inf 1e9 + 1
int main() {
int n;
cin >> n;
int a[n];
f(i, 0, n) cin >> a[i];
int dp[n][n];
f(i, 0, n) dp[i][i] = a[i];
f(l, 1, n) {
f(i, 0, n - l) {
int j = i + l;
dp[i][j] = max(a[i] - dp[i + 1][j], a[j] - dp[i][j - 1]);
}
}
cout << dp[0][n - 1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define f(i, x, y) for (int i = x; i < y; i++)
#define ll long long
#define mp make_pair
#define F first
#define S second
#define N 100005
#define inf 1e9 + 1
int main() {
int n;
cin >> n;
int a[n];
f(i, 0, n) cin >> a[i];
ll dp[n][n];
f(i, 0, n) dp[i][i] = a[i];
f(l, 1, n) {
f(i, 0, n - l) {
int j = i + l;
dp[i][j] = max(a[i] - dp[i + 1][j], a[j] - dp[i][j - 1]);
}
}
cout << dp[0][n - 1];
return 0;
} | [
"variable_declaration.type.change"
] | 979,541 | 979,542 | u440947888 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
int mod = INT_MAX;
int memo[3005][3005];
int n;
int top(int a[], int i, int j) {
int &ans = memo[i][j];
if (i > j)
return 0;
if (ans != -1)
return ans;
int turn = (n - 1 - (j - i)) % 2;
if (turn == 0) // player 1 turn
{
ans = ((max(a[i] + top(a, i + 1, j), a[j] + top(a, i, j - 1)))) % mod;
} else // player 2 turn
{
ans = (min(top(a, i + 1, j), top(a, i, j - 1))) % mod;
}
return ans;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
int a[n];
int sum = 0;
memset(memo, -1, sizeof(memo));
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
int x = top(a, 0, n - 1);
int y = sum - x;
// cout << x << " " << y << " " << sum << endl;
cout << (x - y);
return 0;
}
// 3 8
// 3 30
// 4 50
// 5 60 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
int mod = INT_MAX;
int memo[3005][3005];
int n;
int top(int a[], int i, int j) {
int &ans = memo[i][j];
if (i > j)
return 0;
if (ans != -1)
return ans;
int turn = (n - 1 - (j - i)) % 2;
if (turn == 0) // player 1 turn
{
ans = ((max(a[i] + top(a, i + 1, j), a[j] + top(a, i, j - 1))));
} else // player 2 turn
{
ans = (min(top(a, i + 1, j), top(a, i, j - 1)));
}
return ans;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
int a[n];
int sum = 0;
memset(memo, -1, sizeof(memo));
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
int x = top(a, 0, n - 1);
int y = sum - x;
// cout << x << " " << y << " " << sum << endl;
cout << (x - y);
return 0;
}
// 3 8
// 3 30
// 4 50
// 5 60 | [
"expression.operation.binary.remove"
] | 979,549 | 979,550 | u362998653 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fi first
#define se second
#define pb push_back
#define mod 1000000007
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
if (x == 0)
return 0;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
bool sortinrev(const pair<vector<int>, int> &a,
const pair<vector<int>, int> &b) {
if (a.fi == b.fi)
return b.se > a.se;
return a.fi > b.fi;
}
void run(vector<int> v) {
for (int i = 0; i < v.size(); i++)
cout << v[i] << " ";
cout << endl;
}
void solve() {
int n;
cin >> n;
int a[n];
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
ll table[n][n];
for (int gap = 0; gap < n; gap++) {
for (int i = 0, j = gap; j < n; ++i, ++j) {
int x = ((i + 2) <= j) ? table[i + 2][j] : 0;
int y = ((i + 1) <= (j - 1)) ? table[i + 1][j - 1] : 0;
int z = ((i) <= (j - 2)) ? table[i][j - 2] : 0;
table[i][j] = max(a[i] + min(x, y), a[j] + min(y, z));
}
}
cout << 2 * table[0][n - 1] - sum << endl;
}
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fi first
#define se second
#define pb push_back
#define mod 1000000007
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
if (x == 0)
return 0;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
bool sortinrev(const pair<vector<int>, int> &a,
const pair<vector<int>, int> &b) {
if (a.fi == b.fi)
return b.se > a.se;
return a.fi > b.fi;
}
void run(vector<int> v) {
for (int i = 0; i < v.size(); i++)
cout << v[i] << " ";
cout << endl;
}
void solve() {
int n;
cin >> n;
ll a[n];
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
// cout<<sum<<endl;
ll table[n][n];
for (int gap = 0; gap < n; gap++) {
for (int i = 0, j = gap; j < n; ++i, ++j) {
ll x = ((i + 2) <= j) ? table[i + 2][j] : 0;
ll y = ((i + 1) <= (j - 1)) ? table[i + 1][j - 1] : 0;
ll z = ((i) <= (j - 2)) ? table[i][j - 2] : 0;
table[i][j] = max(a[i] + min(x, y), a[j] + min(y, z));
}
}
cout << 2 * table[0][n - 1] - sum << endl;
}
int main() {
solve();
return 0;
} | [
"variable_declaration.type.change"
] | 979,551 | 979,552 | u417639837 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fi first
#define se second
#define pb push_back
#define mod 1000000007
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
if (x == 0)
return 0;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
bool sortinrev(const pair<vector<int>, int> &a,
const pair<vector<int>, int> &b) {
if (a.fi == b.fi)
return b.se > a.se;
return a.fi > b.fi;
}
void run(vector<int> v) {
for (int i = 0; i < v.size(); i++)
cout << v[i] << " ";
cout << endl;
}
void solve() {
int n;
cin >> n;
int a[n];
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
int table[n][n];
for (int gap = 0; gap < n; gap++) {
for (int i = 0, j = gap; j < n; ++i, ++j) {
int x = ((i + 2) <= j) ? table[i + 2][j] : 0;
int y = ((i + 1) <= (j - 1)) ? table[i + 1][j - 1] : 0;
int z = ((i) <= (j - 2)) ? table[i][j - 2] : 0;
table[i][j] = max(a[i] + min(x, y), a[j] + min(y, z));
}
}
cout << 2 * table[0][n - 1] - sum << endl;
}
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fi first
#define se second
#define pb push_back
#define mod 1000000007
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
if (x == 0)
return 0;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
bool sortinrev(const pair<vector<int>, int> &a,
const pair<vector<int>, int> &b) {
if (a.fi == b.fi)
return b.se > a.se;
return a.fi > b.fi;
}
void run(vector<int> v) {
for (int i = 0; i < v.size(); i++)
cout << v[i] << " ";
cout << endl;
}
void solve() {
int n;
cin >> n;
ll a[n];
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
// cout<<sum<<endl;
ll table[n][n];
for (int gap = 0; gap < n; gap++) {
for (int i = 0, j = gap; j < n; ++i, ++j) {
ll x = ((i + 2) <= j) ? table[i + 2][j] : 0;
ll y = ((i + 1) <= (j - 1)) ? table[i + 1][j - 1] : 0;
ll z = ((i) <= (j - 2)) ? table[i][j - 2] : 0;
table[i][j] = max(a[i] + min(x, y), a[j] + min(y, z));
}
}
cout << 2 * table[0][n - 1] - sum << endl;
}
int main() {
solve();
return 0;
} | [
"variable_declaration.type.change"
] | 979,553 | 979,552 | u417639837 | cpp |
p03171 | #include <bits/stdc++.h>
#define lli long long int
#define endl "\n"
#define forn(i, in, fin) for (int i = in; i < fin; i++)
#define all(v) v.begin(), v.end()
#define fastIO() \
; \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
int main() {
// fastIO();
lli n;
cin >> n;
int dp[n][n];
vector<lli> nums(n);
for (auto &x : nums) {
cin >> x;
}
for (int L = n - 1; L >= 0; L--) // 0-> max, 1->min
{
for (int R = L; R < n; R++) {
if (L == R) {
dp[L][R] = nums[L];
// continue;
}
dp[L][R] = max(nums[L] - dp[L + 1][R], nums[R] - dp[L][R - 1]);
}
}
cout << dp[0][n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
#define lli long long int
#define endl "\n"
#define forn(i, in, fin) for (int i = in; i < fin; i++)
#define all(v) v.begin(), v.end()
#define fastIO() \
; \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
int main() {
// fastIO();
lli n;
cin >> n;
lli dp[n][n];
vector<lli> nums(n);
for (auto &x : nums) {
cin >> x;
}
for (int L = n - 1; L >= 0; L--) {
for (int R = L; R < n; R++) {
if (L == R) {
dp[L][R] = nums[L];
continue;
}
dp[L][R] = max(nums[L] - dp[L + 1][R], nums[R] - dp[L][R - 1]);
// cout<<dp[L][R]<<endl;
}
}
cout << dp[0][n - 1] << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 979,558 | 979,559 | u987915219 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define faster \
cin.tie(0); \
ios_base::sync_with_stdio(0)
#define ll long long
int n, k;
ll arr[3004];
// fun(i,j)=arr[i]+fun(i+1,j),arr[j]+fun(i,j-1);
ll dp[3004][3004];
ll find(int i, int j) {
if (i > j)
return 0;
if (dp[i][j] != -1)
return dp[i][j];
// player 1 picks left
ll cost1 = arr[i] + min(find(i + 1, j - 1), find(i + 2, j - 1));
// player 2 picks right
ll cost2 = arr[j] + min(find(i + 1, j - 1), find(i, j - 2));
return dp[i][j] = max(cost1, cost2);
}
int main() {
memset(dp, -1, sizeof(dp));
int n;
cin >> n;
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
sum += arr[i];
}
// cout<<sum<<endl;
ll x = find(0, n - 1);
ll y = sum - x;
cout << (x - y) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define faster \
cin.tie(0); \
ios_base::sync_with_stdio(0)
#define ll long long
int n, k;
ll arr[3004];
// fun(i,j)=arr[i]+fun(i+1,j),arr[j]+fun(i,j-1);
ll dp[3004][3004];
ll find(int i, int j) {
if (i > j)
return 0;
if (dp[i][j] != -1)
return dp[i][j];
// player 1 picks left
ll cost1 = arr[i] + min(find(i + 1, j - 1), find(i + 2, j));
// player 2 picks right
ll cost2 = arr[j] + min(find(i + 1, j - 1), find(i, j - 2));
return dp[i][j] = max(cost1, cost2);
}
int main() {
memset(dp, -1, sizeof(dp));
int n;
cin >> n;
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
sum += arr[i];
}
// cout<<sum<<endl;
ll x = find(0, n - 1);
ll y = sum - x;
cout << (x - y) << endl;
}
| [
"expression.operation.binary.remove",
"variable_declaration.type.change"
] | 979,560 | 979,561 | u829903680 | cpp |
p03171 | #include <cstring>
#include <iostream>
using namespace std;
/*long mem[3001][3001];
long rec(int a[], int n, int i, int j, int ch)
{
if(i==j)
return ch?-a[i]:a[i];
if(mem[i][j]!=1e9+5)
return mem[i][j];
long ans=0;
long ans1=rec(a,n,i+1,j,!ch);
long ans2=rec(a,n,i,j-1,!ch);
if(ch==0)
ans=max(ans1+a[i],ans2+a[j]);
else
ans=min(ans1-a[i],ans2-a[j]);
mem[i][j]=ans;
return ans;
}*/
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
/*for(int i=0;i<=3000;i++)
{
for(int j=0;j<=3000;j++)
mem[i][j]=1e9+5;
}
cout<<rec(a,n,0,n-1,0)<<endl;*/
int dp[n + 1][n + 1];
int sign = n % 2 ? 1 : -1;
for (int i = 0; i < n; i++) {
dp[i][0] = 0;
dp[0][i] = 0;
dp[i][i] = a[i] * sign;
}
int ch = 0;
for (int i = 2; i <= n; i++) {
ch = 0;
for (int j = 0; j + i <= n; j++) {
int right = j + i - 1;
ch = (n - (right - j + 1)) % 2;
if (ch == 0) {
dp[j][i + j - 1] =
max(dp[j + 1][i + j - 1] + a[j], dp[j][i + j - 2] + a[i + j - 1]);
ch = 1;
} else {
dp[j][i + j - 1] =
min(dp[j + 1][i + j - 1] - a[j], dp[j][i + j - 2] - a[i + j - 1]);
ch = 0;
}
}
}
cout << dp[0][n - 1];
} | #include <cstring>
#include <iostream>
using namespace std;
/*long mem[3001][3001];
long rec(int a[], int n, int i, int j, int ch)
{
if(i==j)
return ch?-a[i]:a[i];
if(mem[i][j]!=1e9+5)
return mem[i][j];
long ans=0;
long ans1=rec(a,n,i+1,j,!ch);
long ans2=rec(a,n,i,j-1,!ch);
if(ch==0)
ans=max(ans1+a[i],ans2+a[j]);
else
ans=min(ans1-a[i],ans2-a[j]);
mem[i][j]=ans;
return ans;
}*/
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
/*for(int i=0;i<=3000;i++)
{
for(int j=0;j<=3000;j++)
mem[i][j]=1e9+5;
}
cout<<rec(a,n,0,n-1,0)<<endl;*/
long dp[n + 1][n + 1];
int sign = n % 2 ? 1 : -1;
for (int i = 0; i < n; i++) {
dp[i][0] = 0;
dp[0][i] = 0;
dp[i][i] = a[i] * sign;
}
int ch = 0;
for (int i = 2; i <= n; i++) {
ch = 0;
for (int j = 0; j + i <= n; j++) {
int right = j + i - 1;
ch = (n - (right - j + 1)) % 2;
if (ch == 0) {
dp[j][i + j - 1] =
max(dp[j + 1][i + j - 1] + a[j], dp[j][i + j - 2] + a[i + j - 1]);
ch = 1;
} else {
dp[j][i + j - 1] =
min(dp[j + 1][i + j - 1] - a[j], dp[j][i + j - 2] - a[i + j - 1]);
ch = 0;
}
}
}
cout << dp[0][n - 1];
} | [
"variable_declaration.type.primitive.change"
] | 979,562 | 979,563 | u933124026 | cpp |
p03171 | #include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define FF first
#define SS second
#define pii pair<int, int>
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define sz(x) (int)x.size()
#define mp make_pair
#define Mod 1000000007
typedef long long int ll;
// g++ -DLOCAL -std=c++17 -Wshadow -Wall "codeforces.c++" -fsanitize=address
// -fsanitize=undefined -D_GLIBCXX_DEBUG -g
// dp[i] -> store result whether present player playing the tuen is able to win
// or not if i stones left
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// #endif
int n, l, r;
cin >> n;
vector<int> seq(n);
for (int &x : seq)
cin >> x;
// cout<<seq.size()<<"\n";
// for(int x : seq)
// cout<<x<<" ";
vector<vector<int>> dp(n, vector<int>(n));
for (l = n - 1; l >= 0; l--)
for (r = l; r < n; r++) {
// cout<<l<<" "<<r<<"\n";
if (l == r)
dp[l][r] = seq[l];
else
dp[l][r] = max(seq[l] - dp[l + 1][r], seq[r] - dp[l][r - 1]);
}
cout << dp[0][n - 1] << "\n";
}
| #include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define FF first
#define SS second
#define pii pair<int, int>
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define sz(x) (int)x.size()
#define mp make_pair
#define Mod 1000000007
typedef long long int ll;
// g++ -DLOCAL -std=c++17 -Wshadow -Wall "codeforces.c++" -fsanitize=address
// -fsanitize=undefined -D_GLIBCXX_DEBUG -g
// dp[i] -> store result whether present player playing the tuen is able to win
// or not if i stones left
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// #endif
int n, l, r;
cin >> n;
vector<int> seq(n);
for (int &x : seq)
cin >> x;
// cout<<seq.size()<<"\n";
// for(int x : seq)
// cout<<x<<" ";
vector<vector<ll>> dp(n, vector<ll>(n));
for (l = n - 1; l >= 0; l--)
for (r = l; r < n; r++) {
// cout<<l<<" "<<r<<"\n";
if (l == r)
dp[l][r] = seq[l];
else
dp[l][r] = max(seq[l] - dp[l + 1][r], seq[r] - dp[l][r - 1]);
}
cout << dp[0][n - 1] << "\n";
}
| [] | 979,576 | 979,577 | u918169477 | cpp |
p03171 | #include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define FF first
#define SS second
#define pii pair<int, int>
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define sz(x) (int)x.size()
#define mp make_pair
#define Mod 1000000007
typedef long long int ll;
// dp[i] -> store result whether present player playing the tuen is able to win
// or not if i stones left
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// #endif
int n, i, l, r;
cin >> n;
vector<int> seq(n);
for (int &x : seq)
cin >> x;
// cout<<seq.size()<<"\n";
// for(int x : seq)
// cout<<x<<" ";
vector<vector<int>> dp(n, vector<int>(n));
for (l = n - 1; l >= 0; l--)
for (r = l; r < n; r++) {
// cout<<l<<" "<<r<<"\n";
if (l == r)
dp[l][r] = seq[l];
else
dp[l][r] = max(seq[l] - dp[l + 1][r], seq[r] - dp[l][r - 1]);
}
cout << dp[0][n - 1] << "\n";
}
| #include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define FF first
#define SS second
#define pii pair<int, int>
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define sz(x) (int)x.size()
#define mp make_pair
#define Mod 1000000007
typedef long long int ll;
// g++ -DLOCAL -std=c++17 -Wshadow -Wall "codeforces.c++" -fsanitize=address
// -fsanitize=undefined -D_GLIBCXX_DEBUG -g
// dp[i] -> store result whether present player playing the tuen is able to win
// or not if i stones left
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// #endif
int n, l, r;
cin >> n;
vector<int> seq(n);
for (int &x : seq)
cin >> x;
// cout<<seq.size()<<"\n";
// for(int x : seq)
// cout<<x<<" ";
vector<vector<ll>> dp(n, vector<ll>(n));
for (l = n - 1; l >= 0; l--)
for (r = l; r < n; r++) {
// cout<<l<<" "<<r<<"\n";
if (l == r)
dp[l][r] = seq[l];
else
dp[l][r] = max(seq[l] - dp[l + 1][r], seq[r] - dp[l][r - 1]);
}
cout << dp[0][n - 1] << "\n";
}
| [
"variable_declaration.remove"
] | 979,578 | 979,577 | u918169477 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define sz(x) ((long long)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const ld eps = 1e-9;
const ld pi = acosl(-1);
const int mod = 998244353;
const int mod1 = 1e9 + 7;
mt19937_64 rnd(time(0));
void faster() {
cin.tie(nullptr);
cout.tie(nullptr);
ios::sync_with_stdio(false);
}
signed main() {
faster();
// freopen("in", "r", stdin);
// freopen("out", "w", stdout);
//______________________________________
/*__*/ double start = clock(); /*__*/
//_____________________________________
int n;
cin >> n;
int a[n];
pair<int, int> dp[n][n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
dp[i][i] = {a[i], 0};
}
for (int szq = 1; szq < n; szq++) {
for (int l = 0; l + szq < n; l++) {
int r = l + szq;
if (dp[l][r - 1].second + a[r] > dp[l + 1][r].second + a[l]) {
dp[l][r] = {dp[l][r - 1].second + a[r], dp[l][r - 1].first};
} else
dp[l][r] = {dp[l + 1][r].second + a[l], dp[l + 1][r].first};
// cout << l << " " << r << ' ' << dp[l][r].first << " "
// <<dp[l][r].second << endl;
}
}
auto ans = dp[0][n - 1];
cout << ans.first - ans.second;
//______________________________________
cerr << "Time " << (clock() - start) * 1.0 / CLOCKS_PER_SEC << "s\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define sz(x) ((long long)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define int long long
const ld eps = 1e-9;
const ld pi = acosl(-1);
const int mod = 998244353;
const int mod1 = 1e9 + 7;
mt19937_64 rnd(time(0));
void faster() {
cin.tie(nullptr);
cout.tie(nullptr);
ios::sync_with_stdio(false);
}
signed main() {
faster();
// freopen("in", "r", stdin);
// freopen("out", "w", stdout);
//______________________________________
/*__*/ double start = clock(); /*__*/
//_____________________________________
int n;
cin >> n;
int a[n];
pair<int, int> dp[n][n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
dp[i][i] = {a[i], 0};
}
for (int szq = 1; szq < n; szq++) {
for (int l = 0; l + szq < n; l++) {
int r = l + szq;
if (dp[l][r - 1].second + a[r] > dp[l + 1][r].second + a[l]) {
dp[l][r] = {dp[l][r - 1].second + a[r], dp[l][r - 1].first};
} else
dp[l][r] = {dp[l + 1][r].second + a[l], dp[l + 1][r].first};
// cout << l << " " << r << ' ' << dp[l][r].first << " "
// <<dp[l][r].second << endl;
}
}
auto ans = dp[0][n - 1];
cout << ans.first - ans.second;
//______________________________________
cerr << "Time " << (clock() - start) * 1.0 / CLOCKS_PER_SEC << "s\n";
return 0;
} | [] | 979,579 | 979,580 | u834005964 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (int)1e9 + 7
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define rrep(i, a, b) for (int i = a; i > b; --i)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define pii pair<int, int>
#define pll pair<long, long>
#define vpii vector<pii>
#define vpll vector<pll>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define PI 3.1415926535897932384626433832795
#define fix(f, n) fixed << setprecision(n) << f
#define all(x) x.begin(), x.end()
ll powM(ll a, ll b, ll m) {
a %= m;
ll ans = 1;
while (b > 0) {
if (b & 1)
ans = ans * a % m;
a = a * a % m;
b >>= 1;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
vl a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
vvl dp(n + 2, vl(n + 1, 0));
// dp[l][r]---all the cards from [l,r] have been distributed .
for (int l = n; l >= 1; l--) {
for (int r = l; r <= n; r++) {
dp[l][r] = max(a[l] - dp[l + 1][r], a[r] - dp[l][r - 1]);
}
}
cout << dp[3][4] << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (int)1e9 + 7
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define rrep(i, a, b) for (int i = a; i > b; --i)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define pii pair<int, int>
#define pll pair<long, long>
#define vpii vector<pii>
#define vpll vector<pll>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define PI 3.1415926535897932384626433832795
#define fix(f, n) fixed << setprecision(n) << f
#define all(x) x.begin(), x.end()
ll powM(ll a, ll b, ll m) {
a %= m;
ll ans = 1;
while (b > 0) {
if (b & 1)
ans = ans * a % m;
a = a * a % m;
b >>= 1;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
vl a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
vvl dp(n + 2, vl(n + 1, 0));
// dp[l][r]---all the cards from [l,r] have been distributed .
for (int l = n; l >= 1; l--) {
for (int r = l; r <= n; r++) {
dp[l][r] = max(a[l] - dp[l + 1][r], a[r] - dp[l][r - 1]);
}
}
cout << dp[1][n] << "\n";
return 0;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 979,581 | 979,582 | u499675841 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define RFOR(i, b, a) for (int i = (b)-1; i >= (a); i--)
#define ITER(it, a) for (typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define FILL(a, value) memset(a, value, sizeof(a)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define er erase
#define in insert
#define f first
// #define s second
typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<vector<int>> VVI;
typedef vector<vector<LL>> VVL;
typedef vector<vector<pair<int, int>>> VVPI;
typedef vector<vector<pair<LL, LL>>> VVPL;
typedef vector<pair<LL, LL>> PL;
typedef vector<PL> VPL;
typedef pair<int, int> PII;
typedef vector<PII> VPI;
const double PI = acos(-1.0);
const int INF = 1e9;
const LL LINF = (LL)1e18;
const double EPS = 1e-7;
const int MAS = 3 * 1e5 + 10;
const int mod = 998244353;
const int MOD = 1e9 + 7;
const int LOG = 19;
const int ar = 1e5 + 100;
const int MAX = 1e6 + 1e2;
int dp[3005][3005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
VI a(n);
rep(i, n) cin >> a[i];
RFOR(l, n, 0)
FOR(r, l, n) {
if (l == r)
dp[l][r] = a[l];
else
dp[l][r] = max(a[l] - dp[l + 1][r], a[r] - dp[l][r - 1]);
}
cout << dp[0][n - 1];
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define RFOR(i, b, a) for (int i = (b)-1; i >= (a); i--)
#define ITER(it, a) for (typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define FILL(a, value) memset(a, value, sizeof(a)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define er erase
#define in insert
#define f first
// #define s second
typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<vector<int>> VVI;
typedef vector<vector<LL>> VVL;
typedef vector<vector<pair<int, int>>> VVPI;
typedef vector<vector<pair<LL, LL>>> VVPL;
typedef vector<pair<LL, LL>> PL;
typedef vector<PL> VPL;
typedef pair<int, int> PII;
typedef vector<PII> VPI;
const double PI = acos(-1.0);
const int INF = 1e9;
const LL LINF = (LL)1e18;
const double EPS = 1e-7;
const int MAS = 3 * 1e5 + 10;
const int mod = 998244353;
const int MOD = 1e9 + 7;
const int LOG = 19;
const int ar = 1e5 + 100;
const int MAX = 1e6 + 1e2;
LL dp[3005][3005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
VI a(n);
rep(i, n) cin >> a[i];
RFOR(l, n, 0)
FOR(r, l, n) {
if (l == r)
dp[l][r] = a[l];
else
dp[l][r] = max(a[l] - dp[l + 1][r], a[r] - dp[l][r - 1]);
}
cout << dp[0][n - 1];
}
| [
"variable_declaration.type.change"
] | 979,583 | 979,584 | u368004512 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
ll arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
ll dp[n + 1][n + 1];
for (int i = n - 2; i >= 0; i--) {
for (int j = i; j < n; j++) {
if (i == j)
dp[i][j] = arr[i];
else
dp[i][j] = max(arr[i] - dp[i + 1][j], arr[j] - dp[i][j - 1]);
}
}
cout << dp[0][n - 1];
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
ll arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
ll dp[n + 1][n + 1] = {0};
for (int i = n - 1; i >= 0; i--) {
for (int j = i; j < n; j++) {
if (i == j)
dp[i][j] = arr[i];
else
dp[i][j] = max(arr[i] - dp[i + 1][j], arr[j] - dp[i][j - 1]);
}
}
cout << dp[0][n - 1];
} | [
"variable_declaration.value.change",
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 979,594 | 979,595 | u659210268 | cpp |
p03171 | #include <iostream>
#include <vector>
using namespace std;
int dp[3100][3100];
// int dp[30][30];
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
for (int i = 0; i < N; ++i) {
dp[i][i] = 0;
}
for (int len = 1; len <= N; ++len) {
for (int i = 0; i + len <= N; ++i) {
int j = i + len;
// first
if ((N - len) % 2 == 0) {
// int one = dp[i+1][j] +a[i];
// int two = dp[i][j-1] + a[j-1];
dp[i][j] = max(dp[i + 1][j] + a[i], dp[i][j - 1] + a[j - 1]);
} else {
// second
// int one = dp[i+1][j] -a[i];
// int two = dp[i][j-1] - a[j-1];
dp[i][j] = min(dp[i + 1][j] - a[i], dp[i][j - 1] - a[j - 1]);
}
}
}
cout << dp[0][N] << endl;
} | #include <iostream>
#include <vector>
using namespace std;
long long dp[3100][3100];
// int dp[30][30];
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
for (int i = 0; i < N; ++i) {
dp[i][i] = 0;
}
for (int len = 1; len <= N; ++len) {
for (int i = 0; i + len <= N; ++i) {
int j = i + len;
// first
if ((N - len) % 2 == 0) {
// int one = dp[i+1][j] +a[i];
// int two = dp[i][j-1] + a[j-1];
dp[i][j] = max(dp[i + 1][j] + a[i], dp[i][j - 1] + a[j - 1]);
} else {
// second
// int one = dp[i+1][j] -a[i];
// int two = dp[i][j-1] - a[j-1];
dp[i][j] = min(dp[i + 1][j] - a[i], dp[i][j - 1] - a[j - 1]);
}
}
}
cout << dp[0][N] << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 979,603 | 979,604 | u218744484 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define int long long
#define fill(x, v) memset(x, v, sizeof(x))
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#define ios std::ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
/*
std::cout << std::setprecision(9) << f << '\n';//3.141590000;
map<char,int>::reverse_iterator rit;
for(rit = mp.rbegin(); rit!=mp.rend(); rit++)
*/
int n;
int dp[3001][3001];
int arr[3001];
int x, y;
// dp[l][r]= max(a[l]-dp[l+1][r], a[r]-dp[l][r-]);
int winner() {
for (int l = n - 1; l >= 0; l--)
for (int r = l; r < n; r++)
if (l == r)
dp[l][r] = max(arr[l] - dp[l + 1][r], arr[r] - dp[l][r - 1]);
else
dp[l][r] = arr[l];
return dp[0][n - 1];
}
int32_t main() {
ios;
cin >> n;
int sum = 0;
for (int i = 0; i < n; i++)
cin >> arr[i];
x = winner();
cout << x << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define int long long
#define fill(x, v) memset(x, v, sizeof(x))
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#define ios std::ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
/*
std::cout << std::setprecision(9) << f << '\n';//3.141590000;
map<char,int>::reverse_iterator rit;
for(rit = mp.rbegin(); rit!=mp.rend(); rit++)
*/
int n;
int dp[3001][3001];
int arr[3001];
int x, y;
// dp[l][r]= max(a[l]-dp[l+1][r], a[r]-dp[l][r-]);
int winner() {
for (int l = n - 1; l >= 0; l--)
for (int r = l; r < n; r++)
if (l != r)
dp[l][r] = max(arr[l] - dp[l + 1][r], arr[r] - dp[l][r - 1]);
else
dp[l][r] = arr[l];
return dp[0][n - 1];
}
int32_t main() {
ios;
cin >> n;
int sum = 0;
for (int i = 0; i < n; i++)
cin >> arr[i];
x = winner();
cout << x << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 979,608 | 979,609 | u992312894 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> a(N);
for (int i = 0; i < N; i++)
cin >> a.at(i);
int64_t dp[N][N];
for (int i = 0; i < N; i++)
dp[i][i] = a.at(i);
for (int i = 0; i < N - 1; i++)
dp[i][i + 1] = max(a.at(i), a.at(i + 1)) - min(a.at(i), a.at(i + 1));
for (int l = 2; l <= N - 1; l++) {
for (int i = 0; i < N - l; i++) {
int j = i + l;
dp[i][j] =
max(a[i] + min(dp[i + 2][j] - a[i + 1], dp[i + 1][j - 1] - a[j]),
a[j] + min(dp[i + 1][j - 1] - a[i], dp[i][j - 2]) - a[j - 1]);
}
}
cout << dp[0][N - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> a(N);
for (int i = 0; i < N; i++)
cin >> a.at(i);
int64_t dp[N][N];
for (int i = 0; i < N; i++)
dp[i][i] = a.at(i);
for (int i = 0; i < N - 1; i++)
dp[i][i + 1] = max(a.at(i), a.at(i + 1)) - min(a.at(i), a.at(i + 1));
for (int l = 2; l <= N - 1; l++) {
for (int i = 0; i < N - l; i++) {
int j = i + l;
dp[i][j] =
max(a[i] + min(dp[i + 2][j] - a[i + 1], dp[i + 1][j - 1] - a[j]),
a[j] + min(dp[i + 1][j - 1] - a[i], dp[i][j - 2] - a[j - 1]));
}
}
cout << dp[0][N - 1] << endl;
return 0;
} | [
"call.arguments.change"
] | 979,610 | 979,611 | u101018317 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define fi first
#define se second
#define endl '\n'
#define mx 1e18
#define mod 1000000007
#define lb(v, x) lower_bound(v.begin(), v.end(), x)
#define ub(v, x) upper_bound(v.begin(), v.end(), x)
#define pb push_back
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
ll powe(ll x, ll n) {
if (n == 0)
return 1;
else if (n % 2 == 0) // n is even
return powe(((x % mod) * (x % mod)) % mod, n / 2);
else // n is odd
return (
(x % mod * (powe(((x % mod) * (x % mod)) % mod, (n - 1) / 2)) % mod) %
mod);
}
int main() {
io int n;
cin >> n;
vector<int> a(n);
vector<vector<int>> dp(3005, vector<int>(3005, 0));
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = n - 1; i >= 0; i--) {
for (int j = i; j <= n - 1; j++) {
if (i == j)
dp[i][j] = a[i];
else
dp[i][j] = max(a[i] - dp[i + 1][j], a[j] - dp[i][j - 1]);
}
}
cout << dp[0][n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define fi first
#define se second
#define endl '\n'
#define mx 1e18
#define mod 1000000007
#define lb(v, x) lower_bound(v.begin(), v.end(), x)
#define ub(v, x) upper_bound(v.begin(), v.end(), x)
#define pb push_back
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
ll powe(ll x, ll n) {
if (n == 0)
return 1;
else if (n % 2 == 0) // n is even
return powe(((x % mod) * (x % mod)) % mod, n / 2);
else // n is odd
return (
(x % mod * (powe(((x % mod) * (x % mod)) % mod, (n - 1) / 2)) % mod) %
mod);
}
int main() {
io int n;
cin >> n;
vector<ll> a(n);
vector<vector<ll>> dp(3005, vector<ll>(3005, 0));
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = n - 1; i >= 0; i--) {
for (int j = i; j <= n - 1; j++) {
if (i == j)
dp[i][j] = a[i];
else
dp[i][j] = max(a[i] - dp[i + 1][j], a[j] - dp[i][j - 1]);
}
}
cout << dp[0][n - 1] << endl;
} | [
"call.arguments.change"
] | 979,616 | 979,617 | u355913876 | cpp |
p03171 | #include <bits/stdc++.h>
// #define int long long int //comment for large arrays
#define pll pair<int, int>
#define dbl long double
#define ff first
#define ss second
#define endl "\n"
#define mod 1000000007
#define eps 0.00000001
#define INF 10000000000000001
#define all(x) (x).begin(), (x).end()
#define LB(v, x) (lower_bound(all(v), x) - v.begin())
#define UB(v, x) (upper_bound(all(v), x) - v.begin())
#define size(x) (int)(x).size()
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define popb() pop_back()
#define popf() pop_front()
#define mp(x, y) make_pair((x), (y))
#define vec(dt) vector<dt>
#define vv(dt) vector<vector<dt>>
#define fastio(x) \
ios_base::sync_with_stdio(x); \
cin.tie(NULL)
#define init(v, s) memset(v, s, sizeof(v))
#define bug(x) \
cerr << "LINE: " << __LINE__ << " || click to see test details " << #x \
<< " = " << x << endl
#define loop(i, s, n) for (int i = s; i < n; i++)
#define print(v) \
for (auto it : v) \
cout << it << " "; \
cout << endl
using namespace std;
signed main() {
fastio(0);
int n;
cin >> n;
int a[n + 1], dp[n + 1][n + 1];
loop(i, 1, n + 1) {
cin >> a[i];
dp[i][i] = a[i];
}
for (int i = n; i > 0; i--)
for (int j = i + 1; j <= n; j++)
dp[i][j] = max(a[i] - dp[i + 1][j], a[j] - dp[i][j - 1]);
cout << dp[1][n] << endl;
return 0;
} | #include <bits/stdc++.h>
#define int long long int // comment for large arrays
#define pll pair<int, int>
#define dbl long double
#define ff first
#define ss second
#define endl "\n"
#define mod 1000000007
#define eps 0.00000001
#define INF 10000000000000001
#define all(x) (x).begin(), (x).end()
#define LB(v, x) (lower_bound(all(v), x) - v.begin())
#define UB(v, x) (upper_bound(all(v), x) - v.begin())
#define size(x) (int)(x).size()
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define popb() pop_back()
#define popf() pop_front()
#define mp(x, y) make_pair((x), (y))
#define vec(dt) vector<dt>
#define vv(dt) vector<vector<dt>>
#define fastio(x) \
ios_base::sync_with_stdio(x); \
cin.tie(NULL)
#define init(v, s) memset(v, s, sizeof(v))
#define bug(x) \
cerr << "LINE: " << __LINE__ << " || click to see test details " << #x \
<< " = " << x << endl
#define loop(i, s, n) for (int i = s; i < n; i++)
#define print(v) \
for (auto it : v) \
cout << it << " "; \
cout << endl
using namespace std;
signed main() {
fastio(0);
int n;
cin >> n;
int a[n + 1], dp[n + 1][n + 1];
loop(i, 1, n + 1) {
cin >> a[i];
dp[i][i] = a[i];
}
for (int i = n; i > 0; i--)
for (int j = i + 1; j <= n; j++)
dp[i][j] = max(a[i] - dp[i + 1][j], a[j] - dp[i][j - 1]);
cout << dp[1][n] << endl;
return 0;
} | [] | 979,618 | 979,619 | u889896098 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n][n], graph[n][n];
for (int i = 0; i < n; i++) {
dp[i][i] = a[i];
graph[i][i] = 0;
}
for (int i = 1; i < n; i++) {
for (int j = i - 1; j >= 0; j--) {
if (i != j) {
dp[j][i] = max(a[i] + graph[j][i - 1], a[j] + graph[j + 1][i]);
graph[j][i] = min(dp[j][i - 1], dp[j + 1][i]);
}
}
}
cout << dp[0][n - 1] - graph[0][n - 1] << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
long long int dp[n][n], graph[n][n];
for (int i = 0; i < n; i++) {
dp[i][i] = a[i];
graph[i][i] = 0;
}
for (int i = 1; i < n; i++) {
for (int j = i - 1; j >= 0; j--) {
if (i != j) {
dp[j][i] = max(a[i] + graph[j][i - 1], a[j] + graph[j + 1][i]);
graph[j][i] = min(dp[j][i - 1], dp[j + 1][i]);
}
}
}
cout << dp[0][n - 1] - graph[0][n - 1] << "\n";
return 0;
} | [
"variable_declaration.type.widen.change"
] | 979,620 | 979,621 | u561103039 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vl;
typedef pair<ll, ll> pll;
#define MOD 1000000007
#define INF 1000000000
#define mp make_pair
#define pb push_back
#define ss second
#define ff first
#define endl '\n'
#define pl cout << endl;
#define tc \
int t; \
cin >> t; \
while (t--)
#define get cin >>
#define geta \
ll a[n]; \
for (int i = 0; i < n; ++i) { \
cin >> a[i]; \
}
#define puta \
for (int i = 0; i < n; ++i) { \
cout << a[i]; \
}
#define put cout <<
ll maxi = LLONG_MIN;
ll mini = LLONG_MAX;
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int dp[3005][3005];
int main() {
fast();
memset(dp, 0, sizeof(dp));
int n;
cin >> n;
vector<ll> a(n + 1);
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
for (int i = n; i >= 1; --i) {
dp[i][i] = a[i];
for (int j = i + 1; j <= n; ++j) {
dp[i][j] = max(a[j] - dp[i][j - 1], a[i] - dp[i + 1][j]);
}
}
cout << dp[1][n];
return 0;
}
// dp1[i][j] =maximum score the first one to make
// the move can obtain by using a[i] to a[j]
// dp2[i][j] =maximum score the 2nd one to make
// the move can obtain by using a[i] to a[j]
// dp1[i][i] for all i from 1 to n is a[i]
// dp2[i][i] = 0
// dp1[i][j]=max(a[i]+dp2[i+1][j],a[j]+dp2[i][j-1])
// if(a[i]+dp2[i+1][j]>a[j]+dp2[i][j-1])
// {
// dp2[i][j]=dp1[i+1][j];
// }
// else
// {
// dp2[i][j]=dp1[i][j-1];
// }
// What if dp1[i+1][j]>a[i]+dp2[i+1][j] and a[i]+dp2[i+1][j]>a[j]+dp2[i][j-1]
// and a[j]+dp2[i][j-1]>dp1[i][j-1] | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vl;
typedef pair<ll, ll> pll;
#define MOD 1000000007
#define INF 1000000000
#define mp make_pair
#define pb push_back
#define ss second
#define ff first
#define endl '\n'
#define pl cout << endl;
#define tc \
int t; \
cin >> t; \
while (t--)
#define get cin >>
#define geta \
ll a[n]; \
for (int i = 0; i < n; ++i) { \
cin >> a[i]; \
}
#define puta \
for (int i = 0; i < n; ++i) { \
cout << a[i]; \
}
#define put cout <<
ll maxi = LLONG_MIN;
ll mini = LLONG_MAX;
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
ll dp[3005][3005];
int main() {
fast();
memset(dp, 0, sizeof(dp));
int n;
cin >> n;
vector<ll> a(n + 1);
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
for (int i = n; i >= 1; --i) {
dp[i][i] = a[i];
for (int j = i + 1; j <= n; ++j) {
dp[i][j] = max(a[j] - dp[i][j - 1], a[i] - dp[i + 1][j]);
}
}
cout << dp[1][n];
return 0;
}
// dp1[i][j] =maximum score the first one to make
// the move can obtain by using a[i] to a[j]
// dp2[i][j] =maximum score the 2nd one to make
// the move can obtain by using a[i] to a[j]
// dp1[i][i] for all i from 1 to n is a[i]
// dp2[i][i] = 0
// dp1[i][j]=max(a[i]+dp2[i+1][j],a[j]+dp2[i][j-1])
// if(a[i]+dp2[i+1][j]>a[j]+dp2[i][j-1])
// {
// dp2[i][j]=dp1[i+1][j];
// }
// else
// {
// dp2[i][j]=dp1[i][j-1];
// }
// What if dp1[i+1][j]>a[i]+dp2[i+1][j] and a[i]+dp2[i+1][j]>a[j]+dp2[i][j-1]
// and a[j]+dp2[i][j-1]>dp1[i][j-1] | [
"variable_declaration.type.change"
] | 979,622 | 979,623 | u014905136 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vl;
typedef pair<ll, ll> pll;
#define MOD 1000000007
#define INF 1000000000
#define mp make_pair
#define pb push_back
#define ss second
#define ff first
#define endl '\n'
#define pl cout << endl;
#define tc \
int t; \
cin >> t; \
while (t--)
#define get cin >>
#define geta \
ll a[n]; \
for (int i = 0; i < n; ++i) { \
cin >> a[i]; \
}
#define puta \
for (int i = 0; i < n; ++i) { \
cout << a[i]; \
}
#define put cout <<
ll maxi = LLONG_MIN;
ll mini = LLONG_MAX;
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int dp[301][301];
int main() {
fast();
memset(dp, 0, sizeof(dp));
int n;
cin >> n;
vector<ll> a(n + 1);
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
for (int i = n; i >= 1; --i) {
dp[i][i] = a[i];
for (int j = i + 1; j <= n; ++j) {
dp[i][j] = max(a[j] - dp[i][j - 1], a[i] - dp[i + 1][j]);
}
}
cout << dp[1][n];
return 0;
}
// dp1[i][j] =maximum score the first one to make
// the move can obtain by using a[i] to a[j]
// dp2[i][j] =maximum score the 2nd one to make
// the move can obtain by using a[i] to a[j]
// dp1[i][i] for all i from 1 to n is a[i]
// dp2[i][i] = 0
// dp1[i][j]=max(a[i]+dp2[i+1][j],a[j]+dp2[i][j-1])
// if(a[i]+dp2[i+1][j]>a[j]+dp2[i][j-1])
// {
// dp2[i][j]=dp1[i+1][j];
// }
// else
// {
// dp2[i][j]=dp1[i][j-1];
// }
// What if dp1[i+1][j]>a[i]+dp2[i+1][j] and a[i]+dp2[i+1][j]>a[j]+dp2[i][j-1]
// and a[j]+dp2[i][j-1]>dp1[i][j-1] | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vl;
typedef pair<ll, ll> pll;
#define MOD 1000000007
#define INF 1000000000
#define mp make_pair
#define pb push_back
#define ss second
#define ff first
#define endl '\n'
#define pl cout << endl;
#define tc \
int t; \
cin >> t; \
while (t--)
#define get cin >>
#define geta \
ll a[n]; \
for (int i = 0; i < n; ++i) { \
cin >> a[i]; \
}
#define puta \
for (int i = 0; i < n; ++i) { \
cout << a[i]; \
}
#define put cout <<
ll maxi = LLONG_MIN;
ll mini = LLONG_MAX;
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
ll dp[3005][3005];
int main() {
fast();
memset(dp, 0, sizeof(dp));
int n;
cin >> n;
vector<ll> a(n + 1);
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
for (int i = n; i >= 1; --i) {
dp[i][i] = a[i];
for (int j = i + 1; j <= n; ++j) {
dp[i][j] = max(a[j] - dp[i][j - 1], a[i] - dp[i + 1][j]);
}
}
cout << dp[1][n];
return 0;
}
// dp1[i][j] =maximum score the first one to make
// the move can obtain by using a[i] to a[j]
// dp2[i][j] =maximum score the 2nd one to make
// the move can obtain by using a[i] to a[j]
// dp1[i][i] for all i from 1 to n is a[i]
// dp2[i][i] = 0
// dp1[i][j]=max(a[i]+dp2[i+1][j],a[j]+dp2[i][j-1])
// if(a[i]+dp2[i+1][j]>a[j]+dp2[i][j-1])
// {
// dp2[i][j]=dp1[i+1][j];
// }
// else
// {
// dp2[i][j]=dp1[i][j-1];
// }
// What if dp1[i+1][j]>a[i]+dp2[i+1][j] and a[i]+dp2[i+1][j]>a[j]+dp2[i][j-1]
// and a[j]+dp2[i][j-1]>dp1[i][j-1] | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 979,624 | 979,623 | u014905136 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
#define f(i, a, b) for (ll(i) = (a); (i) < (b); (i)++)
ll n;
ll a[10000];
ll dp[3010][3010];
ll find(ll i, ll j) {
if (i > j) {
return 0;
}
if (dp[i][j] != -1) {
return dp[i][j];
}
ll c1 = a[i] + min(find(i + 1, j - 1), find(i + 2, j - 1));
ll c2 = a[j] + min(find(i + 1, j - 1), find(i, j - 2));
return dp[i][j] = max(c1, c2);
}
int main() {
cin >> n;
ll sum = 0;
f(i, 0, n) {
cin >> a[i];
sum += a[i];
}
f(i, 0, n + 1) {
f(j, 0, n + 1) { dp[i][j] = -1; }
}
cout << 2 * find(0, n - 1) - (sum);
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
#define f(i, a, b) for (ll(i) = (a); (i) < (b); (i)++)
ll n;
ll a[10000];
ll dp[3100][3100];
ll find(ll i, ll j) {
if (i > j) {
return 0;
}
if (dp[i][j] != -1) {
return dp[i][j];
}
ll c1 = a[i] + min(find(i + 1, j - 1), find(i + 2, j));
ll c2 = a[j] + min(find(i + 1, j - 1), find(i, j - 2));
return dp[i][j] = max(c1, c2);
}
int main() {
cin >> n;
ll sum = 0;
f(i, 0, n) {
cin >> a[i];
sum += a[i];
}
f(i, 0, n + 2) {
f(j, 0, n + 2) { dp[i][j] = -1; }
}
cout << 2 * find(0, n - 1) - (sum);
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operation.binary.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 979,631 | 979,632 | u778436491 | cpp |
p03171 | // We only fail when we stop trying
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define endl '\n'
#define D(x) cerr << #x << " = " << (x) << '\n'
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
const int N = 3007;
int n;
int arr[N];
int dp[N][N];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++)
dp[i][i] = arr[i];
for (int len = 2; len <= n; len++) {
for (int i = 0; i + len <= n; i++) {
int j = i + len - 1;
dp[i][j] = max(arr[i] - dp[i + 1][j], arr[j] - dp[i][j - 1]);
}
}
cout << dp[0][n - 1] << endl;
return 0;
}
| // We only fail when we stop trying
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define endl '\n'
#define D(x) cerr << #x << " = " << (x) << '\n'
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
const int N = 3007;
int n;
int arr[N];
long long dp[N][N];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++)
dp[i][i] = arr[i];
for (int len = 2; len <= n; len++) {
for (int i = 0; i + len <= n; i++) {
int j = i + len - 1;
dp[i][j] = max(arr[i] - dp[i + 1][j], arr[j] - dp[i][j - 1]);
}
}
cout << dp[0][n - 1] << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 979,635 | 979,636 | u371586991 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define int long long
const int N = 5007, inf = 1e18;
int n, a[N], dp[N][N];
int rec(int l, int r) {
if (dp[l][r] != -inf)
return dp[l][r];
dp[l][r] = max(a[l] - rec(l + 1, r), a[r] - rec(l, r - 1));
return dp[l][r];
}
void preset() {
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
dp[i][j] = -inf;
}
}
}
signed main() {
fastio;
preset();
cin >> n;
int sum = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
sum += a[i];
}
for (int i = 0; i < n; ++i) {
dp[i][i] = a[i];
}
cout << (sum + rec(0, n - 1)) / 2;
return 0;
}
/* input
*/ | #include <bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define int long long
const int N = 5007, inf = 1e18;
int n, a[N], dp[N][N];
int rec(int l, int r) {
if (dp[l][r] != -inf)
return dp[l][r];
dp[l][r] = max(a[l] - rec(l + 1, r), a[r] - rec(l, r - 1));
return dp[l][r];
}
void preset() {
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
dp[i][j] = -inf;
}
}
}
signed main() {
fastio;
preset();
cin >> n;
int sum = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
sum += a[i];
}
for (int i = 0; i < n; ++i) {
dp[i][i] = a[i];
}
cout << rec(0, n - 1);
return 0;
}
/* input
*/ | [
"expression.operation.binary.remove"
] | 979,639 | 979,640 | u740487324 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define F first
#define S second
#define P pair<int, int>
#define pb push_back
#define db(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
const int N = 3005;
int n;
int a[N];
int memo[N][N];
int dp(int l, int r) {
if (l == r)
return a[l];
if (l > r)
return -1e18;
int &ans = memo[l][r];
if (ans != -1e18)
return ans;
ans = -dp(l + 1, r) + a[l];
ans = max(ans, -dp(l + 1, r) + a[r]);
return ans;
}
void solve() {
int i, j, k, m, ans = 0, cnt = 0, sum = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < N; i++) {
for (j = 0; j < N; j++) {
memo[i][j] = -1e18;
}
}
cout << dp(0, n - 1);
return;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// int t; cin >> t; while (t--)
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define F first
#define S second
#define P pair<int, int>
#define pb push_back
#define db(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
const int N = 3005;
int n;
int a[N];
int memo[N][N];
int dp(int l, int r) {
if (l == r)
return a[l];
if (l > r)
return -1e18;
int &ans = memo[l][r];
if (ans != -1e18)
return ans;
ans = -dp(l + 1, r) + a[l];
ans = max(ans, -dp(l, r - 1) + a[r]);
return ans;
}
void solve() {
int i, j, k, m, ans = 0, cnt = 0, sum = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < N; i++) {
for (j = 0; j < N; j++) {
memo[i][j] = -1e18;
}
}
cout << dp(0, n - 1);
return;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// int t; cin >> t; while (t--)
solve();
return 0;
} | [
"expression.operation.binary.remove",
"assignment.change"
] | 979,641 | 979,642 | u064488844 | cpp |
p03171 | #include <iostream>
int a[3003];
int dp[3003][3003];
int main() {
int n;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
for (int len = 1; len <= n; len++) {
for (int i = 0; i + len <= n; i++) {
int j = i + len;
if ((n - len) % 2 == 0) {
dp[i][j] = std::max(dp[i + 1][j] + a[i], dp[i][j - 1] + a[j - 1]);
} else {
dp[i][j] = std::min(dp[i + 1][j] - a[i], dp[i][j - 1] - a[j - 1]);
}
}
}
std::cout << dp[0][n] << std::endl;
}
| #include <iostream>
int a[3003];
long long dp[3003][3003];
int main() {
int n;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
for (int len = 1; len <= n; len++) {
for (int i = 0; i + len <= n; i++) {
int j = i + len;
if ((n - len) % 2 == 0) {
dp[i][j] = std::max(dp[i + 1][j] + a[i], dp[i][j - 1] + a[j - 1]);
} else {
dp[i][j] = std::min(dp[i + 1][j] - a[i], dp[i][j - 1] - a[j - 1]);
}
}
}
std::cout << dp[0][n] << std::endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 979,643 | 979,644 | u718277423 | cpp |
p03171 | #include <bits/stdc++.h>
#define fin \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
using namespace std;
#define ll long long
ll dp[3005][3005][2];
int a[3005];
int mod = 1e9 + 7;
#define MAX 1e18 + 5;
int solve(int i, int j, int k) {
if (dp[i][j][k] != -1)
return dp[i][j][k];
else if (i == j) {
if (k == 0)
dp[i][j][k] = a[i];
else
dp[i][j][k] = -a[i];
} else {
if (k == 0)
dp[i][j][k] = max(a[i] + solve(i + 1, j, !k), a[j] + solve(i, j - 1, !k));
else
dp[i][j][k] =
min(-a[i] + solve(i + 1, j, !k), -a[j] + solve(i, j - 1, !k));
}
return dp[i][j][k];
}
int main() {
fin;
int n, i, j;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
memset(dp, -1, sizeof(dp));
cout << solve(0, n - 1, 0);
}
| #include <bits/stdc++.h>
#define fin \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
using namespace std;
#define ll long long
ll dp[3005][3005][2];
int a[3005];
int mod = 1e9 + 7;
#define MAX 1e18 + 5;
ll solve(int i, int j, int k) {
if (dp[i][j][k] != -1)
return dp[i][j][k];
else if (i == j) {
if (k == 0)
dp[i][j][k] = a[i];
else
dp[i][j][k] = -a[i];
} else {
if (k == 0)
dp[i][j][k] = max(a[i] + solve(i + 1, j, !k), a[j] + solve(i, j - 1, !k));
else
dp[i][j][k] =
min(-a[i] + solve(i + 1, j, !k), -a[j] + solve(i, j - 1, !k));
}
return dp[i][j][k];
}
int main() {
fin;
int n, i, j;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
memset(dp, -1, sizeof(dp));
cout << solve(0, n - 1, 0);
}
| [] | 979,645 | 979,646 | u559274475 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1e12;
int main() {
int n;
cin >> n;
vector<vector<int>> dp(n, vector<int>(n));
vector<int> v(n);
for (int &x : v)
cin >> x;
for (int i = 0; i < n; ++i)
dp[i][i] = v[i];
for (int l = n - 1; l >= 0; --l)
for (int r = l + 1; r < n; ++r)
dp[l][r] = max(v[l] - dp[l + 1][r], v[r] - dp[l][r - 1]);
cout << dp[0][n - 1] << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const long long INF = 1e12;
int main() {
int n;
cin >> n;
vector<vector<long long>> dp(n, vector<long long>(n));
vector<int> v(n);
for (int &x : v)
cin >> x;
for (int i = 0; i < n; ++i)
dp[i][i] = v[i];
for (int l = n - 1; l >= 0; --l)
for (int r = l + 1; r < n; ++r)
dp[l][r] = max(v[l] - dp[l + 1][r], v[r] - dp[l][r - 1]);
cout << dp[0][n - 1] << '\n';
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 979,649 | 979,650 | u158312277 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define f(i, a, b) for (ll i = (a); i < (b); i++)
#define frr(i, a, b) for (ll i = (a - 1); i >= (b); i--)
#define vi vector<int>
#define de deque<int>
#define del deque<ll>
#define vl vector<ll>
#define pb push_back
#define ppb pop_back()
#define pf push_front
#define ppf pop_front()
#define mpp map<ll, ll>
#define rev(a) reverse(a.begin(), a.end())
#define srt(a) sort(a.begin(), a.end())
#define ln(a) a.length()
#define sz(a) a.size()
#define endl "\n"
int M = 1000000007;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int a[n];
f(i, 0, n) cin >> a[i];
int dp[n + 1][n + 1];
memset(dp, 0, sizeof dp);
frr(i, n, 0) {
f(j, 0, n) {
if (i == j) {
if (n % 2 == 1)
dp[i][j] = a[i];
else {
dp[i][j] = -a[i];
}
} else if ((i + j + 1) % 2 == n % 2) {
dp[i][j] = max(dp[i + 1][j] + a[i], dp[i][j - 1] + a[j]);
} else {
dp[i][j] = min(dp[i + 1][j] - a[i], dp[i][j - 1] - a[j]);
}
}
}
cout << dp[0][n - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define f(i, a, b) for (ll i = (a); i < (b); i++)
#define frr(i, a, b) for (ll i = (a - 1); i >= (b); i--)
#define vi vector<int>
#define de deque<int>
#define del deque<ll>
#define vl vector<ll>
#define pb push_back
#define ppb pop_back()
#define pf push_front
#define ppf pop_front()
#define mpp map<ll, ll>
#define rev(a) reverse(a.begin(), a.end())
#define srt(a) sort(a.begin(), a.end())
#define ln(a) a.length()
#define sz(a) a.size()
#define endl "\n"
int M = 1000000007;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
ll a[n];
f(i, 0, n) cin >> a[i];
ll dp[n + 1][n + 1];
memset(dp, 0, sizeof dp);
frr(i, n, 0) {
f(j, i, n) {
if (i == j) {
if (n % 2 == 1)
dp[i][j] = a[i];
else {
dp[i][j] = -a[i];
}
} else if ((i + j + 1) % 2 == n % 2) {
dp[i][j] = max(dp[i + 1][j] + a[i], dp[i][j - 1] + a[j]);
} else {
dp[i][j] = min(dp[i + 1][j] - a[i], dp[i][j - 1] - a[j]);
}
}
}
cout << dp[0][n - 1] << endl;
}
| [
"variable_declaration.type.change",
"call.arguments.change"
] | 979,656 | 979,657 | u550103492 | cpp |
p03171 | #include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define pbds \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
//#include <boost/math/common_factor.cpp>
using namespace std;
#define fi first
#define sec second
#define mod 1000000007
#define MOD 998244353
#define mod9 1000000009
#define ll long long
#define ld long double
#define int long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define rep(i, a, b) for (i = a; i < (int)b; i++)
#define repr(i, a, b) for (i = a; i >= (int)b; i--)
#define mp make_pair
#define t() \
int t; \
cin >> t; \
while (t--)
#define vll vector<ll>
#define setbits(x) __builtin_popcountll(x)
#define all(p) p.begin(), p.end()
#define N 1000000000
#define cMAXN 100
#define endl '\n'
#define zro(x) __builtin_ctzll(x)
//#define T pair<int, int>
//#define ordered_set tree<T, null_type, less<T>, rb_tree_tag,
//tree_order_statistics_node_update>
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << endl;
// use cerr if u want to display at the bottom
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
bool isV(char x) {
if (x == 'a' || x == 'e' || x == 'i' || x == 'o' || x == 'u') {
return 1;
}
return 0;
}
bool isP(ll n) {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return 0;
}
return 1;
}
void fio() {
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("in.txt", "r", stdin);
// for writing output to output.txt
freopen("out.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
}
void print(int *a, int n) {
int i;
rep(i, 0, n) { cout << a[i] << " "; }
cout << endl;
}
void print2d(int a[][1000], int m, int n) {
int i, j;
rep(i, 0, m) {
rep(j, 0, n) { cout << setw(2) << a[i][j]; }
cout << endl;
}
}
/*bool comp(pii i1, pii i2)
{
//For Ascending Order (i1.fi < i2.sec)
if(i1.sec == i2.sec)
return (i1.fi > i2.fi);
return (i1.sec > i2.sec);
}*/
// All Functions below this
// Main Function
int32_t main() {
// fio();
int n;
cin >> n;
int *a = new int[n];
int i, j;
rep(i, 0, n) { cin >> a[i]; }
int d[n + 1][n + 1];
memset(d, 0, sizeof(d));
repr(i, n - 1, 0) {
rep(j, i, n) {
if (i == j)
d[i][j] = (n % 2 == 0 ? -1 : +1) * a[i];
else if ((i - j) % 2 != n % 2)
d[i][j] = max(d[i + 1][j] + a[i], a[j] + d[i][j - 1]);
else
d[i][j] = min(d[i + 1][j] - a[i], -a[j] + d[i][j - 1]);
}
}
cout << d[0][n - 1] << endl;
;
}
| #include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define pbds \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
//#include <boost/math/common_factor.cpp>
using namespace std;
#define fi first
#define sec second
#define mod 1000000007
#define MOD 998244353
#define mod9 1000000009
#define ll long long
#define ld long double
#define int long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define rep(i, a, b) for (i = a; i < (int)b; i++)
#define repr(i, a, b) for (i = a; i >= (int)b; i--)
#define mp make_pair
#define t() \
int t; \
cin >> t; \
while (t--)
#define vll vector<ll>
#define setbits(x) __builtin_popcountll(x)
#define all(p) p.begin(), p.end()
#define N 1000000000
#define cMAXN 100
#define endl '\n'
#define zro(x) __builtin_ctzll(x)
//#define T pair<int, int>
//#define ordered_set tree<T, null_type, less<T>, rb_tree_tag,
//tree_order_statistics_node_update>
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << endl;
// use cerr if u want to display at the bottom
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
bool isV(char x) {
if (x == 'a' || x == 'e' || x == 'i' || x == 'o' || x == 'u') {
return 1;
}
return 0;
}
bool isP(ll n) {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return 0;
}
return 1;
}
void fio() {
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("in.txt", "r", stdin);
// for writing output to output.txt
freopen("out.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
}
void print(int *a, int n) {
int i;
rep(i, 0, n) { cout << a[i] << " "; }
cout << endl;
}
void print2d(int a[][1000], int m, int n) {
int i, j;
rep(i, 0, m) {
rep(j, 0, n) { cout << setw(2) << a[i][j]; }
cout << endl;
}
}
/*bool comp(pii i1, pii i2)
{
//For Ascending Order (i1.fi < i2.sec)
if(i1.sec == i2.sec)
return (i1.fi > i2.fi);
return (i1.sec > i2.sec);
}*/
// All Functions below this
// Main Function
int32_t main() {
// fio();
int n;
cin >> n;
int *a = new int[n];
int i, j;
rep(i, 0, n) { cin >> a[i]; }
int d[n + 1][n + 1];
memset(d, 0, sizeof(d));
repr(i, n - 1, 0) {
rep(j, i, n) {
if (i == j)
d[i][j] = (n % 2 == 0 ? -1 : +1) * a[i];
else if ((j - i) % 2 != n % 2)
d[i][j] = max(d[i + 1][j] + a[i], a[j] + d[i][j - 1]);
else {
d[i][j] = min(d[i + 1][j] - a[i], -a[j] + d[i][j - 1]);
}
// trace(i,j,d[i][j]);
}
}
cout << d[0][n - 1] << endl;
;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 979,666 | 979,667 | u526674581 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i > 0; i++)
using ll = long long;
int n;
vector<int> a(3300);
int dp[3300][3300];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
rep(i, n) cin >> a[i];
for (int width = 1; width <= n; width++) {
for (int l = 0; l + width <= n; l++) {
int r = l + width;
if (width % 2 == n % 2)
dp[l][r] = max(dp[l + 1][r] + a[l], dp[l][r - 1] + a[r - 1]);
else
dp[l][r] = min(dp[l + 1][r] - a[l], dp[l][r - 1] - a[r - 1]);
}
}
cout << dp[0][n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i > 0; i++)
using ll = long long;
ll n;
vector<ll> a(3300);
ll dp[3300][3300];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
rep(i, n) cin >> a[i];
for (int width = 1; width <= n; width++) {
for (int l = 0; l + width <= n; l++) {
ll r = l + width;
if (width % 2 == n % 2)
dp[l][r] = max(dp[l + 1][r] + a[l], dp[l][r - 1] + a[r - 1]);
else
dp[l][r] = min(dp[l + 1][r] - a[l], dp[l][r - 1] - a[r - 1]);
}
}
cout << dp[0][n] << endl;
} | [
"variable_declaration.type.change"
] | 979,670 | 979,671 | u297398560 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long *a = new long long[n];
for (int i = 0; i < n; i++)
cin >> a[i];
long long dp[n][n];
// memset(dp,0,sizeof(dp));
for (int l = n - 1; l >= 0; l--) {
for (int r = l; r < n; r++) {
if (l == r)
dp[l][r] = a[l];
dp[l][r] = max(a[l] - dp[l + 1][r], a[r] - dp[l][r - 1]);
}
}
// for(int i=0;i<n;i++)
// {
// for(int j=0;j<n;j++)
// cout<<dp[i][j]<<"\t";
// cout<<endl;
// }
cout << dp[0][n - 1];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long *a = new long long[n];
for (int i = 0; i < n; i++)
cin >> a[i];
long long dp[n][n];
// memset(dp,0,sizeof(dp));
for (int l = n - 1; l >= 0; l--) {
for (int r = l; r < n; r++) {
if (l == r)
dp[l][r] = a[l];
else
dp[l][r] = max(a[l] - dp[l + 1][r], a[r] - dp[l][r - 1]);
}
}
// for(int i=0;i<n;i++)
// {
// for(int j=0;j<n;j++)
// cout<<dp[i][j]<<"\t";
// cout<<endl;
// }
cout << dp[0][n - 1];
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 979,676 | 979,677 | u186260353 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl "\n"
#define fast \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
const ll M = 1e9 + 7;
ll inf = 1e18;
int main() {
fast;
int n;
cin >> n;
vector<ll> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
int dp[n][n];
for (int l = n - 1; l >= 0; l--) {
for (int r = l; r < n; r++) {
if (l == r)
dp[l][r] = v[l];
else
dp[l][r] = max(v[l] - dp[l + 1][r], v[r] - dp[l][r - 1]);
}
}
cout << dp[0][n - 1];
}
| #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl "\n"
#define fast \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
const ll M = 1e9 + 7;
ll inf = 1e18;
int main() {
fast;
int n;
cin >> n;
vector<ll> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
ll dp[n][n];
for (int l = n - 1; l >= 0; l--) {
for (int r = l; r < n; r++) {
if (l == r)
dp[l][r] = v[l];
else
dp[l][r] = max(v[l] - dp[l + 1][r], v[r] - dp[l][r - 1]);
}
}
cout << dp[0][n - 1];
}
| [
"variable_declaration.type.change"
] | 979,680 | 979,681 | u538921852 | cpp |
p03171 |
// It doesn't matter how slow you go, Unless you don't stop.
#include <algorithm>
#include <bitset>
#include <iostream>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <chrono>
#include <fstream>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> p64;
typedef vector<LL> v64;
typedef map<LL, LL> mp64;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define rep(i, s, e) for (long long i = s; i <= e; i++)
#define brep(i, s, e) for (long long i = s; i >= e; i--)
#define all(x) x.begin(), x.end()
#define mem(x, y) memset(x, y, sizeof(x))
#define DANGER \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
int dp[3005][3005];
void solve() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int l = n - 1; l >= 0; l--) {
for (int r = l; r < n; r++) {
if (l == r) {
dp[l][r] = a[l];
} else {
dp[l][r] = max(a[l] - dp[l + 1][r], a[r] - dp[l][r - 1]);
}
}
}
cout << dp[0][n - 1] << endl;
}
int main() {
DANGER;
ofstream out("output.txt");
auto start = chrono::high_resolution_clock::now();
LL t = 1;
// cin>>t;
rep(test, 1, t) { solve(); }
auto stop = chrono::high_resolution_clock::now();
// auto duration = chrono::duration_cast<chrono::milliseconds>(stop - start);
// cout << "Time taken by function: " << duration.count() << " milliseconds"
// << endl;
} |
// It doesn't matter how slow you go, Unless you don't stop.
#include <algorithm>
#include <bitset>
#include <iostream>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <chrono>
#include <fstream>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> p64;
typedef vector<LL> v64;
typedef map<LL, LL> mp64;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define rep(i, s, e) for (long long i = s; i <= e; i++)
#define brep(i, s, e) for (long long i = s; i >= e; i--)
#define all(x) x.begin(), x.end()
#define mem(x, y) memset(x, y, sizeof(x))
#define DANGER \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
LL dp[3005][3005];
void solve() {
int n;
cin >> n;
LL a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int l = n - 1; l >= 0; l--) {
for (int r = l; r < n; r++) {
if (l == r) {
dp[l][r] = a[l];
} else {
dp[l][r] = max(a[l] - dp[l + 1][r], a[r] - dp[l][r - 1]);
}
}
}
cout << dp[0][n - 1] << endl;
}
int main() {
DANGER;
ofstream out("output.txt");
auto start = chrono::high_resolution_clock::now();
LL t = 1;
// cin>>t;
rep(test, 1, t) { solve(); }
auto stop = chrono::high_resolution_clock::now();
// auto duration = chrono::duration_cast<chrono::milliseconds>(stop - start);
// cout << "Time taken by function: " << duration.count() << " milliseconds"
// << endl;
} | [
"variable_declaration.type.change"
] | 979,682 | 979,683 | u287813289 | cpp |
p03171 | /*
* User: Isanchez_Aguilar
* Problem: AtCoder ABC134B - Golden Apple
*/
#include <bits/stdc++.h>
using namespace std;
using Long = long long;
const int MAX_N = 3001;
Long vals[MAX_N];
vector<vector<Long>> memo(MAX_N, vector<Long>(MAX_N, LONG_MIN));
Long dp(int i, int j) {
if (i == j)
return vals[i];
if (memo[i][j] == INT_MIN) {
memo[i][j] = max(vals[i] - dp(i + 1, j), vals[j] - dp(i, j - 1));
}
return memo[i][j];
}
int main(void) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> vals[i];
cout << dp(0, n - 1);
return 0;
} | /*
* User: Isanchez_Aguilar
* Problem: AtCoder ABC134B - Golden Apple
*/
#include <bits/stdc++.h>
using namespace std;
using Long = long long;
const int MAX_N = 3001;
Long vals[MAX_N];
vector<vector<Long>> memo(MAX_N, vector<Long>(MAX_N, LONG_MIN));
Long dp(int i, int j) {
if (i == j)
return vals[i];
if (memo[i][j] == LONG_MIN) {
memo[i][j] = max(vals[i] - dp(i + 1, j), vals[j] - dp(i, j - 1));
}
return memo[i][j];
}
int main(void) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> vals[i];
cout << dp(0, n - 1);
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 979,690 | 979,691 | u858584587 | cpp |
p03171 | #pragma optimization_level 3
#pragma GCC optimize( \
"Ofast") // Comment optimisations for an interatcive problem - use endl
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); \
cout << fixed; \
cout << setprecision(10);
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef unordered_map<ll, ll> um;
typedef vector<pll> vpll;
#define x first
#define y second
const ll N = 5005;
const ll mod = 1e+9 + 7;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
#define maxBits 22
#define maxMask (1 << maxBits)
ll n, vis[N][N], a[N];
ll rem(int f, int i, int j) {
if (vis[i][j] != 0)
return vis[i][j];
if (i > j)
return 0;
if (f == 0)
vis[i][j] = min(rem(1, i + 1, j), rem(1, i, j - 1));
else
vis[i][j] = max(a[i] + rem(0, i + 1, j), a[j] + rem(0, i, j - 1));
return vis[i][j];
}
int main() {
fastio;
cin >> n;
ll s = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
}
ll x = rem(1, 0, n - 1);
cout << abs(2 * x - s) << endl;
} | #pragma optimization_level 3
#pragma GCC optimize( \
"Ofast") // Comment optimisations for an interatcive problem - use endl
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); \
cout << fixed; \
cout << setprecision(10);
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef unordered_map<ll, ll> um;
typedef vector<pll> vpll;
#define x first
#define y second
const ll N = 5005;
const ll mod = 1e+9 + 7;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
#define maxBits 22
#define maxMask (1 << maxBits)
ll n, vis[N][N], a[N];
ll rem(int f, int i, int j) {
if (vis[i][j] != 0)
return vis[i][j];
if (i > j)
return 0;
if (f == 0)
vis[i][j] = min(rem(1, i + 1, j), rem(1, i, j - 1));
else
vis[i][j] = max(a[i] + rem(0, i + 1, j), a[j] + rem(0, i, j - 1));
return vis[i][j];
}
int main() {
fastio;
cin >> n;
ll s = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
}
ll x = rem(1, 0, n - 1);
cout << 2 * x - s << endl;
} | [
"call.remove",
"call.arguments.change"
] | 979,694 | 979,695 | u849660048 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
int dp[3300][3300];
int main() {
int n;
cin >> n;
vll a(n);
rep(i, n) cin >> a.at(i);
rep(i, n) dp[i][i] = 0;
for (int width = 1; width <= n; width++) {
for (int l = 0; l + width <= n; l++) {
int r = l + width;
if (width % 2 == n % 2) {
dp[l][r] = max(dp[l + 1][r] + a[l], dp[l][r - 1] + a[r - 1]);
} else {
dp[l][r] = min(dp[l + 1][r] - a[l], dp[l][r - 1] - a[r - 1]);
}
}
}
cout << dp[0][n] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
ll dp[3300][3300];
int main() {
int n;
cin >> n;
vll a(n);
rep(i, n) cin >> a.at(i);
rep(i, n) dp[i][i] = 0;
for (int width = 1; width <= n; width++) {
for (int l = 0; l + width <= n; l++) {
int r = l + width;
if (width % 2 == n % 2) {
dp[l][r] = max(dp[l + 1][r] + a[l], dp[l][r - 1] + a[r - 1]);
} else {
dp[l][r] = min(dp[l + 1][r] - a[l], dp[l][r - 1] - a[r - 1]);
}
}
}
cout << dp[0][n] << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 979,702 | 979,703 | u615662061 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define N 3005
#define ll long long
ll dp[N][N], n, arr[N];
int main() {
// memset(dp, -1, sizeof(dp));
cin >> n;
for (int i = 1; i <= n; i++)
cin >> arr[i];
for (int i = n; i >= 1; i--) {
for (int j = 1; j <= n; j++) {
dp[i][j] = max(arr[i] - dp[i + 1][j], arr[j] - dp[i][j - 1]);
}
}
cout << dp[1][n] << endl;
// cout << -cal(1, n) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define N 3005
#define ll long long
ll dp[N][N], n, arr[N];
int main() {
// memset(dp, -1, sizeof(dp));
cin >> n;
for (int i = 1; i <= n; i++)
cin >> arr[i];
for (int i = n; i >= 1; i--) {
for (int j = i; j <= n; j++) {
dp[i][j] = max(arr[i] - dp[i + 1][j], arr[j] - dp[i][j - 1]);
}
}
cout << dp[1][n] << endl;
// cout << -cal(1, n) << endl;
}
| [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 979,710 | 979,711 | u399167105 | cpp |
p03171 | /* @Author: Shubham Anand */
#include <algorithm>
#include <chrono>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#define FILEIN freopen("input.txt", "r", stdin)
#define FILEOUT freopen("output.txt", "w", stdout)
#define FASTIO \
std::ios_base::sync_with_stdio(0); \
std::cin.tie(NULL); \
std::cout.tie(NULL)
#define PAUSE \
while (1) { \
}
#define NEWLINE std::cout << "\n"
#define EDGES std::unordered_map<std::pair<int, int>, int>
#define PB(N) push_back(N)
/* Constants */
const unsigned int MODULO = 1e9 + 7;
const unsigned int INF = std::numeric_limits<int>::max();
const int NINF = std::numeric_limits<int>::min();
/* Input Output */
template <class T> void write(const T &a, char del = '\n') {
if (del == '~')
std::cout << a;
else
std::cout << a << del;
}
template <class T> void line(const T &w) {
for (int i = 0; i < (w + 1) / 2; i++)
write('_', '_');
NEWLINE;
}
template <class T> void read(T &a) { std::cin >> a; }
/* Modular Ops */
template <class T> T add(T a, T b, T m) {
a = a % m;
b = b % m;
return (a + b) % m;
}
template <class T> T mul(T a, T b, T m) {
a = a % m;
b = b % m;
return (a * b) % m;
}
/* Basic Algorithms */
template <class T> T gcd(T a, T b) {
if (b > a) {
return gcd(b, a);
}
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
template <class T> T bexp(T a, T b, T m) {
if (b == 1) {
return a;
}
if (b & 1) {
return mul(a, bexp(a, b - 1, m), m);
}
T c = bexp(a, b / 2, m);
return mul(c, c, m);
}
template <class T> T inv(T a, T m) { return bexp(a, m - 2, m); }
/* Commonly used data structures */
namespace ds {
template <class T> struct Point {
T x, y, z;
Point(T _x = 0, T _y = 0, T _z = 0) : x(_x), y(_y), z(_z){};
};
template <class T> struct Graph {
std::vector<T> *adj;
Graph(T n) { adj = new std::vector<T>[n]; }
void add(T u, T v, bool d = 0) {
adj[u].PB(v);
if (!d) {
adj[v].PB(u);
}
}
void w_add(T u, T v, T w, bool d = 0) {
adj[u].PB(std::make_pair(v, w));
if (!d) {
adj[v].PB(std::make_pair(u, w));
}
}
};
} // namespace ds
/* Function to calculate runtime */
void time(void func()) {
std::chrono::time_point<std::chrono::high_resolution_clock> start, end;
start = std::chrono::high_resolution_clock::now();
func();
end = std::chrono::high_resolution_clock::now();
long long elapsed_time =
std::chrono::duration_cast<std::chrono::milliseconds>(end - start)
.count();
std::cout << "\tElapsed Time: " << elapsed_time << "ms\n";
}
/* Declare any global objects here */
typedef long long ull;
int dp[3001][3001];
/************** END ****************/
// ull minimax(int first, int last, ull *vals, bool isMax) {
// // if (mp.find({first, last})!=mp.end()) { return mp[{first, last}]; }
// if (first==last) { return !isMax ? -vals[first]: vals[first]; }
// ull res = 0;
// if (isMax) {
// ull f = vals[first] + minimax(first+1, last, vals, false);
// ull l = vals[last] + minimax(first, last-1, vals, false);
// res = std::max(f, l);
// } else {
// ull f = -vals[first] + minimax(first+1, last, vals, true);
// ull l = -vals[last] + minimax(first, last-1, vals, true);
// res = std::min(f, l);
// }
// std::cout << first << ", " << last << "\t";
// std::cout << res << "\n";
// // mp[{first, last}] = res;
// return res;
// }
void solve() {
int N;
std::cin >> N;
ull val[N];
for (int i = 0; i < N; i++) {
std::cin >> val[i];
}
for (int L = N; ~L; L--) {
for (int R = L; R < N; R++) {
if (L == R) {
dp[L][R] = val[L];
} else {
dp[L][R] = std::max(val[L] - dp[L + 1][R], val[R] - dp[L][R - 1]);
}
}
}
write(dp[0][N - 1]);
}
signed main() {
// FILEIN;
// FILEOUT;
FASTIO;
int T = 1;
// Uncomment to read testcases
// read(T);
while (T--) {
// time(solve);
solve();
}
return 0;
} | /* @Author: Shubham Anand */
#include <algorithm>
#include <chrono>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#define FILEIN freopen("input.txt", "r", stdin)
#define FILEOUT freopen("output.txt", "w", stdout)
#define FASTIO \
std::ios_base::sync_with_stdio(0); \
std::cin.tie(NULL); \
std::cout.tie(NULL)
#define PAUSE \
while (1) { \
}
#define NEWLINE std::cout << "\n"
#define EDGES std::unordered_map<std::pair<int, int>, int>
#define PB(N) push_back(N)
/* Constants */
const unsigned int MODULO = 1e9 + 7;
const unsigned int INF = std::numeric_limits<int>::max();
const int NINF = std::numeric_limits<int>::min();
/* Input Output */
template <class T> void write(const T &a, char del = '\n') {
if (del == '~')
std::cout << a;
else
std::cout << a << del;
}
template <class T> void line(const T &w) {
for (int i = 0; i < (w + 1) / 2; i++)
write('_', '_');
NEWLINE;
}
template <class T> void read(T &a) { std::cin >> a; }
/* Modular Ops */
template <class T> T add(T a, T b, T m) {
a = a % m;
b = b % m;
return (a + b) % m;
}
template <class T> T mul(T a, T b, T m) {
a = a % m;
b = b % m;
return (a * b) % m;
}
/* Basic Algorithms */
template <class T> T gcd(T a, T b) {
if (b > a) {
return gcd(b, a);
}
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
template <class T> T bexp(T a, T b, T m) {
if (b == 1) {
return a;
}
if (b & 1) {
return mul(a, bexp(a, b - 1, m), m);
}
T c = bexp(a, b / 2, m);
return mul(c, c, m);
}
template <class T> T inv(T a, T m) { return bexp(a, m - 2, m); }
/* Commonly used data structures */
namespace ds {
template <class T> struct Point {
T x, y, z;
Point(T _x = 0, T _y = 0, T _z = 0) : x(_x), y(_y), z(_z){};
};
template <class T> struct Graph {
std::vector<T> *adj;
Graph(T n) { adj = new std::vector<T>[n]; }
void add(T u, T v, bool d = 0) {
adj[u].PB(v);
if (!d) {
adj[v].PB(u);
}
}
void w_add(T u, T v, T w, bool d = 0) {
adj[u].PB(std::make_pair(v, w));
if (!d) {
adj[v].PB(std::make_pair(u, w));
}
}
};
} // namespace ds
/* Function to calculate runtime */
void time(void func()) {
std::chrono::time_point<std::chrono::high_resolution_clock> start, end;
start = std::chrono::high_resolution_clock::now();
func();
end = std::chrono::high_resolution_clock::now();
long long elapsed_time =
std::chrono::duration_cast<std::chrono::milliseconds>(end - start)
.count();
std::cout << "\tElapsed Time: " << elapsed_time << "ms\n";
}
/* Declare any global objects here */
typedef long long ull;
ull dp[3001][3001];
/************** END ****************/
void solve() {
int N;
std::cin >> N;
ull val[N];
for (int i = 0; i < N; i++) {
std::cin >> val[i];
}
for (int L = N; ~L; L--) {
for (int R = L; R < N; R++) {
if (L == R) {
dp[L][R] = val[L];
} else {
dp[L][R] = std::max(val[L] - dp[L + 1][R], val[R] - dp[L][R - 1]);
}
}
}
write(dp[0][N - 1]);
}
signed main() {
// FILEIN;
// FILEOUT;
FASTIO;
int T = 1;
// Uncomment to read testcases
// read(T);
while (T--) {
// time(solve);
solve();
}
return 0;
} | [
"variable_declaration.type.change"
] | 979,712 | 979,713 | u958610807 | cpp |
p03171 | #include <bits/stdc++.h>
typedef int ll;
using namespace std;
#define endl '\n'
#define N 4005
ll a[N], dp[N][N], n, k;
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL);
cin >> n;
ll sum = 0;
for (ll i = 1; i <= n; i++) {
cin >> a[i];
sum += a[i];
}
for (ll i = 1; i <= n; i++) {
for (ll j = 1; j <= n - i + 1; j++) {
ll e = i + j - 1;
ll x = 0, y = 0, z = 0;
if (j + 2 <= e)
x = dp[ll(j + 2)][ll(e)];
if (j + 1 <= e - 1)
y = dp[ll(j + 1)][ll(e - 1)];
if (j <= e - 2)
z = dp[ll(j)][ll(e - 2)];
dp[j][e] = max(a[j] + min(x, y), a[e] + min(y, z));
}
}
ll rem = sum - dp[1][n];
cout << dp[1][n] - rem << endl;
return 0;
}
| #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
#define endl '\n'
#define N 4005
ll a[N], dp[N][N], n, k;
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL);
cin >> n;
ll sum = 0;
for (ll i = 1; i <= n; i++) {
cin >> a[i];
sum += a[i];
}
for (ll i = 1; i <= n; i++) {
for (ll j = 1; j <= n - i + 1; j++) {
ll e = i + j - 1;
ll x = 0, y = 0, z = 0;
if (j + 2 <= e)
x = dp[ll(j + 2)][ll(e)];
if (j + 1 <= e - 1)
y = dp[ll(j + 1)][ll(e - 1)];
if (j <= e - 2)
z = dp[ll(j)][ll(e - 2)];
dp[j][e] = max(a[j] + min(x, y), a[e] + min(y, z));
}
}
ll rem = sum - dp[1][n];
cout << dp[1][n] - rem << endl;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 979,718 | 979,719 | u822543121 | cpp |
p03171 | #include <bits/stdc++.h>
typedef int ll;
using namespace std;
#define endl '\n'
#define N 2005
ll a[N], dp[N][N], n, k;
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL);
cin >> n;
ll sum = 0;
for (ll i = 1; i <= n; i++) {
cin >> a[i];
sum += a[i];
}
for (ll i = 1; i <= n; i++) {
for (ll j = 1; j <= n - i + 1; j++) {
ll e = i + j - 1;
ll x = 0, y = 0, z = 0;
if (j + 2 <= e)
x = dp[ll(j + 2)][ll(e)];
if (j + 1 <= e - 1)
y = dp[ll(j + 1)][ll(e - 1)];
if (j <= e - 2)
z = dp[ll(j)][ll(e - 2)];
dp[j][e] = max(a[j] + min(x, y), a[e] + min(y, z));
}
}
ll rem = sum - dp[1][n];
cout << dp[1][n] - rem << endl;
return 0;
}
| #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
#define endl '\n'
#define N 4005
ll a[N], dp[N][N], n, k;
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL);
cin >> n;
ll sum = 0;
for (ll i = 1; i <= n; i++) {
cin >> a[i];
sum += a[i];
}
for (ll i = 1; i <= n; i++) {
for (ll j = 1; j <= n - i + 1; j++) {
ll e = i + j - 1;
ll x = 0, y = 0, z = 0;
if (j + 2 <= e)
x = dp[ll(j + 2)][ll(e)];
if (j + 1 <= e - 1)
y = dp[ll(j + 1)][ll(e - 1)];
if (j <= e - 2)
z = dp[ll(j)][ll(e - 2)];
dp[j][e] = max(a[j] + min(x, y), a[e] + min(y, z));
}
}
ll rem = sum - dp[1][n];
cout << dp[1][n] - rem << endl;
return 0;
}
| [
"preprocessor.define.value.change",
"literal.integer.change"
] | 979,720 | 979,719 | u822543121 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define sll(x) scanf("%lld", &x)
#define prll(x) printf("%lld ", x)
#define pri(x) printf("%d ", x)
#define si(x) scanf("%d", &x)
#define el cout << "\n"
#define pb push_back
#define f first
#define s second
#define arrondi(a) (long long)floor(a + 0.5);
#define NIL -1
ll N = 500005;
ll MAX = 9223372036854775807;
ll MOD = 1000000007;
long double PI = 4 * atan(1);
ll n, m, k;
ll nbr;
int main() {
IOS;
ll n;
cin >> n;
vector<ll> L;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
L.push_back(x);
}
vector<vector<ll>> dp(n + 1, vector<ll>(n + 1, 0));
if (n % 2 == 0) {
for (int i = 0; i < n; i++)
dp[i][i] = -L[i];
for (int len = 2; len <= n; len++) {
for (int i = 0; i <= n - len; i++) {
ll j = i + len - 1;
if (len % 2 == 0)
dp[i][j] = max(dp[i + 1][j] + L[i], dp[i][j - 1] + L[j]);
else
dp[i][j] = min(dp[i + 1][j] - L[i], dp[i][j - 1] - L[j]);
}
}
} else {
for (int i = 0; i < n; i++)
dp[i][i] = L[i];
for (int len = 2; len <= n; len++) {
for (int i = 0; i < n - len; i++) {
ll j = i + len - 1;
if (len % 2 == 1)
dp[i][j] = max(dp[i + 1][j] + L[i], dp[i][j - 1] + L[j]);
else
dp[i][j] = min(dp[i + 1][j] - L[j], dp[i][j - 1] - L[j]);
}
}
}
cout << dp[0][n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define sll(x) scanf("%lld", &x)
#define prll(x) printf("%lld ", x)
#define pri(x) printf("%d ", x)
#define si(x) scanf("%d", &x)
#define el cout << "\n"
#define pb push_back
#define f first
#define s second
#define arrondi(a) (long long)floor(a + 0.5);
#define NIL -1
ll N = 500005;
ll MAX = 9223372036854775807;
ll MOD = 1000000007;
long double PI = 4 * atan(1);
ll n, m, k;
ll nbr;
int main() {
IOS;
ll n;
cin >> n;
vector<ll> L;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
L.push_back(x);
}
vector<vector<ll>> dp(n + 1, vector<ll>(n + 1, 0));
if (n % 2 == 0) {
for (int i = 0; i < n; i++)
dp[i][i] = -L[i];
for (int len = 2; len <= n; len++) {
for (int i = 0; i <= n - len; i++) {
ll j = i + len - 1;
if (len % 2 == 0)
dp[i][j] = max(dp[i + 1][j] + L[i], dp[i][j - 1] + L[j]);
else
dp[i][j] = min(dp[i + 1][j] - L[i], dp[i][j - 1] - L[j]);
}
}
} else {
for (int i = 0; i < n; i++)
dp[i][i] = L[i];
for (int len = 2; len <= n; len++) {
for (int i = 0; i <= n - len; i++) {
ll j = i + len - 1;
if (len % 2 == 1)
dp[i][j] = max(dp[i + 1][j] + L[i], dp[i][j - 1] + L[j]);
else
dp[i][j] = min(dp[i + 1][j] - L[i], dp[i][j - 1] - L[j]);
}
}
}
cout << dp[0][n - 1];
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 979,723 | 979,724 | u266346465 | cpp |
p03171 | // Author: Sparsh Agarwal
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int v[n];
int dp[n][n];
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int l = n - 1; l >= 0; l--) {
for (int r = l; r < n; r++) {
if (l == r) {
dp[l][r] = v[l];
} else {
dp[l][r] = max(v[l] - dp[l + 1][r], v[r] - dp[l][r - 1]);
}
}
}
/*for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cout << dp[i][j] << " ";
}
cout << "\n";
}*/
cout << dp[0][n - 1] << "\n";
return 0;
} | // Author: Sparsh Agarwal
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int v[n];
ll dp[n][n];
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int l = n - 1; l >= 0; l--) {
for (int r = l; r < n; r++) {
if (l == r) {
dp[l][r] = v[l];
} else {
dp[l][r] = max(v[l] - dp[l + 1][r], v[r] - dp[l][r - 1]);
}
}
}
/*for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cout << dp[i][j] << " ";
}
cout << "\n";
}*/
cout << dp[0][n - 1] << "\n";
return 0;
} | [
"variable_declaration.type.change"
] | 979,727 | 979,728 | u960776830 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long mod = 1000000007;
const int mx = 3005;
int dp[mx][mx];
int main() {
int n;
cin >> n;
int a[n];
int i, j, k;
for (i = 0; i < n; i++)
cin >> a[i];
for (int l = n - 1; l >= 0; l--) {
for (int r = l; r < n; r++) {
if (l == r)
dp[l][r] = a[l];
else {
dp[l][r] = max(a[l] - dp[l + 1][r], a[r] - dp[l][r - 1]);
}
}
}
cout << dp[0][n - 1];
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long mod = 1000000007;
const int mx = 3005;
ll dp[mx][mx];
int main() {
int n;
cin >> n;
int a[n];
int i, j, k;
for (i = 0; i < n; i++)
cin >> a[i];
for (int l = n - 1; l >= 0; l--) {
for (int r = l; r < n; r++) {
if (l == r)
dp[l][r] = a[l];
else {
dp[l][r] = max(a[l] - dp[l + 1][r], a[r] - dp[l][r - 1]);
}
}
}
cout << dp[0][n - 1];
}
| [
"variable_declaration.type.change"
] | 979,735 | 979,736 | u919005705 | cpp |
p03171 | #include <bits/stdc++.h>
#define fast_io \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define forit(it, a) \
for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define REP(i, f, t) for (int i = f; i < (int)t; ++i)
#define pb push_back
#define mp make_pair
#define all(a) begin(a), end(a)
#define ff first
#define ss second
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int inf = 1e9 + 5;
int n, k, i, j;
int main() {
fast_io;
cin >> n;
vector<vector<int>> dp(n, vector<int>(n));
vector<int> a(n);
for (int &x : a)
cin >> x;
for (int L = n - 1; L >= 0; --L) {
for (int R = L; R < n; ++R) {
if (L == R)
dp[L][R] = a[L];
else {
dp[L][R] = max(a[L] - dp[L + 1][R], a[R] - dp[L][R - 1]);
}
}
}
cout << dp[0][n - 1];
}
| #include <bits/stdc++.h>
#define fast_io \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define forit(it, a) \
for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define REP(i, f, t) for (int i = f; i < (int)t; ++i)
#define pb push_back
#define mp make_pair
#define all(a) begin(a), end(a)
#define ff first
#define ss second
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int inf = 1e9 + 5;
int n, k, i, j;
int main() {
fast_io;
cin >> n;
vector<vector<ll>> dp(n, vector<ll>(n));
vector<ll> a(n);
for (ll &x : a)
cin >> x;
for (int L = n - 1; L >= 0; --L) {
for (int R = L; R < n; ++R) {
if (L == R)
dp[L][R] = a[L];
else {
dp[L][R] = max(a[L] - dp[L + 1][R], a[R] - dp[L][R - 1]);
}
}
}
cout << dp[0][n - 1];
}
| [] | 979,737 | 979,738 | u360212177 | cpp |
p03171 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <limits>
#include <utility>
#include <vector>
using namespace std;
int N;
vector<long long> v;
vector<vector<long long>> dp;
long long LIM = std::numeric_limits<long long>::min();
long long deque(long long i, long long j) {
long long c = (N - (j - i)) % 2 == 0 ? 1 : -1;
if (i + 1 == j)
return v[i] * c;
if (dp[i + 1][j] == LIM)
dp[i + 1][j] = deque(i + 1, j);
if (dp[i][j - 1] == LIM)
dp[i][j - 1] = deque(i, j - 1);
long long a = v[i] * c + dp[i + 1][j];
long long b = v[j - 1] * c + dp[i][j - 1];
return c < 0 ? min(a, b) : max(a, b);
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0);
std::cin >> N;
v.resize(N);
dp = vector<vector<long long>>(N, vector<long long>(N, LIM));
for (int i = 0; i < N; ++i) {
long long val;
cin >> val;
v[i] = val;
}
std::cout << deque(0, N);
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <limits>
#include <utility>
#include <vector>
using namespace std;
int N;
vector<long long> v;
vector<vector<long long>> dp;
long long LIM = std::numeric_limits<long long>::min();
long long deque(long long i, long long j) {
long long c = (N - j - i) % 2 == 0 ? 1 : -1;
if (i + 1 == j)
return v[i] * c;
if (dp[i + 1][j] == LIM)
dp[i + 1][j] = deque(i + 1, j);
if (dp[i][j - 1] == LIM)
dp[i][j - 1] = deque(i, j - 1);
long long a = v[i] * c + dp[i + 1][j];
long long b = v[j - 1] * c + dp[i][j - 1];
return c < 0 ? min(a, b) : max(a, b);
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0);
std::cin >> N;
v.resize(N);
dp = vector<vector<long long>>(N + 1, vector<long long>(N + 1, LIM));
for (int i = 0; i < N; ++i) {
long long val;
cin >> val;
v[i] = val;
}
std::cout << deque(0, N);
return 0;
} | [
"assignment.change"
] | 979,741 | 979,742 | u395287489 | cpp |
p03171 | #include <iostream>
using namespace std;
int dp[3007][3007];
int tab[3007];
int main() {
int N;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> dp[i][i];
tab[i] = dp[i][i];
}
cout << "\n";
for (int i = 1; i <= N; i++)
for (int j = i - 1; j > 0; j--)
dp[j][i] = max(tab[j] - dp[j + 1][i], tab[i] - dp[j][i - 1]);
/*
for(int i=1; i<=N; i++)
{
for(int j=1; j<=N; j++)
{
cout << dp[i][j] << " ";
}
cout << "\n";
}
*/
cout << dp[1][N];
} | #include <iostream>
using namespace std;
long long dp[3007][3007];
int tab[3007];
int main() {
int N;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> dp[i][i];
tab[i] = dp[i][i];
}
cout << "\n";
for (int i = 1; i <= N; i++)
for (int j = i - 1; j > 0; j--)
dp[j][i] = max(tab[j] - dp[j + 1][i], tab[i] - dp[j][i - 1]);
/*
for(int i=1; i<=N; i++)
{
for(int j=1; j<=N; j++)
{
cout << dp[i][j] << " ";
}
cout << "\n";
}
*/
cout << dp[1][N];
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 979,743 | 979,744 | u098482829 | cpp |
p03171 | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define st first
#define nd second
#define turbo \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define vi vector<int>
#define vvi vector<vi>
#define qi queue<int>
#define ld long double
using namespace std;
/*---------------------------------------------------------///CODE///---------------------------------------------------------*/
int dp[3001][3001][2];
bool vis[3001][3001][2];
int T[3001];
int count_dp(int a, int b, int c) {
if (vis[a][b][c])
return dp[a][b][c];
if (a == b)
return (c ? T[a] * (-1) : T[a]);
vis[a][b][c] = true;
if (c == 0)
dp[a][b][c] =
max(count_dp(a + 1, b, 1) + T[a], count_dp(a, b - 1, 1) + T[b]);
if (c == 1)
dp[a][b][c] =
min(count_dp(a + 1, b, 0) - T[a], count_dp(a, b - 1, 0) - T[b]);
return dp[a][b][c];
}
int main() {
turbo
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> T[i];
cout << count_dp(1, n, 0);
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define st first
#define nd second
#define turbo \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define vi vector<int>
#define vvi vector<vi>
#define qi queue<int>
#define ld long double
using namespace std;
/*---------------------------------------------------------///CODE///---------------------------------------------------------*/
ll dp[3001][3001][2];
bool vis[3001][3001][2];
int T[3001];
ll count_dp(int a, int b, int c) {
if (vis[a][b][c])
return dp[a][b][c];
if (a == b)
return (c ? T[a] * (-1) : T[a]);
vis[a][b][c] = true;
if (c == 0)
dp[a][b][c] =
max(count_dp(a + 1, b, 1) + T[a], count_dp(a, b - 1, 1) + T[b]);
if (c == 1)
dp[a][b][c] =
min(count_dp(a + 1, b, 0) - T[a], count_dp(a, b - 1, 0) - T[b]);
return dp[a][b][c];
}
int main() {
turbo
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> T[i];
cout << count_dp(1, n, 0);
return 0;
} | [
"variable_declaration.type.change"
] | 979,751 | 979,752 | u317997849 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define ireps(i, m, n) for (int i = (int)(m); i <= (int)(n); ++i)
#define FOR(e, c) for (auto &e : c)
#define SORT(v, n) sort(v, v + n);
#define vsort(v) sort(v.begin(), v.end());
#define rvisort(v) sort(v.begin(), v.end(), greater<int>());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout << d << endl;
#define coutd(d) cout << std::setprecision(10) << d << endl;
#define cinline(n) getline(cin, n);
#define replace_all(s, b, a) replace(s.begin(), s.end(), b, a);
// #define int long long
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) int(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using ul = unsigned long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e15;
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll a, ll b) { return a * b / GCD(a, b); }
const int dy[] = {0, 1, 0, -1, -1, 1, 1, -1};
const int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
inline bool inside(int y, int x, int H, int W) {
return (y >= 0 && x >= 0 && y < H && x < W);
}
int n;
int a[3005];
int dp[3005][3005]; // dp[i][j]:=[i,j)の総得点
int rec(int i, int j) {
if (dp[i][j] != -1)
return dp[i][j];
int turn = n - (j - i);
int res;
if (turn % 2 == 0) {
// 先手
res = max(rec(i + 1, j) + a[i], rec(i, j - 1) + a[j - 1]);
} else {
// 後手
res = min(rec(i + 1, j) - a[i], rec(i, j - 1) - a[j - 1]);
}
return dp[i][j] = res;
}
int main() {
cin >> n;
rep(i, n) cin >> a[i];
memset(dp, -1, sizeof(dp));
rep(i, n + 1) dp[i][i] = 0;
cout << rec(0, n) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define ireps(i, m, n) for (int i = (int)(m); i <= (int)(n); ++i)
#define FOR(e, c) for (auto &e : c)
#define SORT(v, n) sort(v, v + n);
#define vsort(v) sort(v.begin(), v.end());
#define rvisort(v) sort(v.begin(), v.end(), greater<int>());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout << d << endl;
#define coutd(d) cout << std::setprecision(10) << d << endl;
#define cinline(n) getline(cin, n);
#define replace_all(s, b, a) replace(s.begin(), s.end(), b, a);
// #define int long long
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) int(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using ul = unsigned long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e15;
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll a, ll b) { return a * b / GCD(a, b); }
const int dy[] = {0, 1, 0, -1, -1, 1, 1, -1};
const int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
inline bool inside(int y, int x, int H, int W) {
return (y >= 0 && x >= 0 && y < H && x < W);
}
int n;
ll a[3005];
ll dp[3005][3005]; // dp[i][j]:=[i,j)の総得点
ll rec(int i, int j) {
if (dp[i][j] != -1)
return dp[i][j];
int turn = n - (j - i);
ll res;
if (turn % 2 == 0) {
// 先手
res = max(rec(i + 1, j) + a[i], rec(i, j - 1) + a[j - 1]);
} else {
// 後手
res = min(rec(i + 1, j) - a[i], rec(i, j - 1) - a[j - 1]);
}
return dp[i][j] = res;
}
int main() {
cin >> n;
rep(i, n) cin >> a[i];
memset(dp, -1, sizeof(dp));
rep(i, n + 1) dp[i][i] = 0;
cout << rec(0, n) << endl;
} | [
"variable_declaration.type.change"
] | 979,755 | 979,756 | u530107518 | cpp |
p03171 | // Created by conan1024hao in 2020.
// Copyright © 2020 conan1024hao. All rights reserved.
// 専用ライブラリです、自由にコピーして構いません。
// 感谢看我的代码！Wechat:conan1024hao Twitter/QQ:810396815
#pragma GCC optimize("O3")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <list>
#include <map>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define IINF 10e8
#define INF 10e17
#define MOD 1000000007
#define mod 1000000007
#define rep(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ? x : y)
#define chmax(x, y) x = mmax(x, y)
#define chmin(x, y) x = mmin(x, y)
#define all(x) (x).begin(), (x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
using namespace std;
// using Int=int_fast64_t;
typedef long long int ll;
typedef long long int LL;
typedef pair<ll, ll> Pll;
typedef pair<int, int> Pin;
template <class T> using V = vector<T>;
long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; }
long long LCM(long long a, long long b) { return a / GCD(a, b) * b; }
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
char dir[4] = {'u', 'l', 'd', 'r'};
ll cmp1(pair<ll, string> a, pair<ll, string> b) {
if (a.fi != b.fi)
return a.fi < b.fi;
else
return a.se < b.se;
}
//---------------------------------------------------------------------------
ll dp[3001][3001];
V<ll> a;
ll n;
ll cal(ll l, ll r) {
if (dp[l][r] > 0)
return dp[l][r];
ll ans;
if (n - (r - l) % 2 == 0) {
if (r - l == 1)
return a[l];
ans = -INF;
ans = mmax(cal(l + 1, r) + a[l], cal(l, r - 1) + a[r - 1]);
} else {
if (r - l == 1)
return 0;
ans = INF;
ans = mmin(cal(l + 1, r), cal(l, r - 1));
}
dp[l][r] = ans;
return ans;
}
//---------------------------------------------------------------------------
int main() { //問題をちゃんと見ろ!!!!!!!!!!!!!!!!! llか??????????统一类型
//memset()!!!!!!!!!!!! ペナを減らせ!!!!!!!!!!!!!
cin.tie(0);
ios::sync_with_stdio(false);
//-------------------------------
cin >> n;
a.resize(n);
ll sum = 0;
for (ll i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
ll X = cal(0, n);
ll Y = sum - X;
cout << X - Y << endl;
//-------------------------------
return 0;
}
//---------------------------------------------------------------------------
| // Created by conan1024hao in 2020.
// Copyright © 2020 conan1024hao. All rights reserved.
// 専用ライブラリです、自由にコピーして構いません。
// 感谢看我的代码！Wechat:conan1024hao Twitter/QQ:810396815
#pragma GCC optimize("O3")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <list>
#include <map>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define IINF 10e8
#define INF 10e17
#define MOD 1000000007
#define mod 1000000007
#define rep(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ? x : y)
#define chmax(x, y) x = mmax(x, y)
#define chmin(x, y) x = mmin(x, y)
#define all(x) (x).begin(), (x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
using namespace std;
// using Int=int_fast64_t;
typedef long long int ll;
typedef long long int LL;
typedef pair<ll, ll> Pll;
typedef pair<int, int> Pin;
template <class T> using V = vector<T>;
long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; }
long long LCM(long long a, long long b) { return a / GCD(a, b) * b; }
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
char dir[4] = {'u', 'l', 'd', 'r'};
ll cmp1(pair<ll, string> a, pair<ll, string> b) {
if (a.fi != b.fi)
return a.fi < b.fi;
else
return a.se < b.se;
}
//---------------------------------------------------------------------------
ll dp[3001][3001];
V<ll> a;
ll n;
ll cal(ll l, ll r) {
if (dp[l][r] > 0)
return dp[l][r];
ll ans;
if ((n - (r - l)) % 2 == 0) {
if (r - l == 1)
return a[l];
ans = -INF;
ans = mmax(cal(l + 1, r) + a[l], cal(l, r - 1) + a[r - 1]);
} else {
if (r - l == 1)
return 0;
ans = INF;
ans = mmin(cal(l + 1, r), cal(l, r - 1));
}
dp[l][r] = ans;
return ans;
}
//---------------------------------------------------------------------------
int main() { //問題をちゃんと見ろ!!!!!!!!!!!!!!!!! llか??????????统一类型
//memset()!!!!!!!!!!!! ペナを減らせ!!!!!!!!!!!!!
cin.tie(0);
ios::sync_with_stdio(false);
//-------------------------------
cin >> n;
a.resize(n);
ll sum = 0;
for (ll i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
ll X = cal(0, n);
ll Y = sum - X;
cout << X - Y << endl;
//-------------------------------
return 0;
}
//---------------------------------------------------------------------------
| [
"control_flow.branch.if.condition.change"
] | 979,757 | 979,758 | u220212997 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define inf INT_MAX
int n;
int a[3005];
int dp[3005][3005][2];
int turn = 0;
int recur(int i, int j, int turn) {
if (i == j) {
return (turn == 0 ? a[i] : -a[i]);
}
int &r = dp[i][j][turn];
if (r != inf)
return dp[i][j][turn];
if (turn == 0) {
return r = max(a[i] + recur(i + 1, j, 1 - turn),
a[j] + recur(i, j - 1, 1 - turn));
} else
return r = min(-a[i] + recur(i + 1, j, 1 - turn),
-a[j] + recur(i, j - 1, 1 - turn));
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
for (int k = 0; k < 2; k++) {
dp[i][j][k] = inf;
}
}
}
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cout << recur(0, n - 1, turn);
}
| #include <bits/stdc++.h>
using namespace std;
#define inf INT_MAX
int n;
int a[3005];
long long dp[3005][3005][2];
int turn = 0;
long long recur(int i, int j, int turn) {
if (i == j) {
return (turn == 0 ? a[i] : -a[i]);
}
long long &r = dp[i][j][turn];
if (r != inf)
return dp[i][j][turn];
if (turn == 0) {
return r = max(a[i] + recur(i + 1, j, 1 - turn),
a[j] + recur(i, j - 1, 1 - turn));
} else
return r = min(-a[i] + recur(i + 1, j, 1 - turn),
-a[j] + recur(i, j - 1, 1 - turn));
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
for (int k = 0; k < 2; k++) {
dp[i][j][k] = inf;
}
}
}
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cout << recur(0, n - 1, turn);
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 979,759 | 979,760 | u083367057 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define inf (int)(1e9 + 7)
#define abs(x) (x >= 0 ? x : -(x))
#define ceil(a, b) a / b + !!(a % b)
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
ll pow(ll a, int b) { return b ? pow(a * a, b / 2) * (b % 2 ? a : 1) : 1; }
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int dp[3001][3001];
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
// 局面の残り石の個数でループ
rep3(len, 1, n + 1) for (int i = 0; i + len <= n; ++i) {
// len = j - i
int j = len + i;
if ((n - len) % 2 == 0) {
dp[i][j] = max(dp[i + 1][j] + a[i], dp[i][j - 1] + a[j - 1]);
} else {
dp[i][j] = min(dp[i + 1][j] - a[i], dp[i][j - 1] - a[j - 1]);
}
}
cout << dp[0][n] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define inf (int)(1e9 + 7)
#define abs(x) (x >= 0 ? x : -(x))
#define ceil(a, b) a / b + !!(a % b)
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
ll pow(ll a, int b) { return b ? pow(a * a, b / 2) * (b % 2 ? a : 1) : 1; }
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll dp[3001][3001];
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
// 局面の残り石の個数でループ
rep3(len, 1, n + 1) for (int i = 0; i + len <= n; ++i) {
// len = j - i
int j = len + i;
if ((n - len) % 2 == 0) {
dp[i][j] = max(dp[i + 1][j] + a[i], dp[i][j - 1] + a[j - 1]);
} else {
dp[i][j] = min(dp[i + 1][j] - a[i], dp[i][j - 1] - a[j - 1]);
}
}
cout << dp[0][n] << endl;
}
| [
"variable_declaration.type.change"
] | 979,761 | 979,762 | u277556971 | cpp |
p03171 | #include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
int *a = new int[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long **dp = new long *[n + 1];
for (int i = 0; i <= n; i++) {
dp[i] = new long[n + 1];
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
dp[i][j] = 0;
// if (i == j)
// dp[i][j] = 0;
// else
// dp[i][j] = -1;
}
}
for (int len = 1; len <= n; len++) {
for (int i = 0; i + len <= n; i++) {
int j = i + len;
if ((n - len) % 2 == 0)
dp[i][j] = (dp[i + 1][j] + a[i]) > (dp[i][j - 1] + a[j - 1])
? (dp[i + 1][j] + a[i])
: (dp[i][j - 1] + a[j - 1]);
else
dp[i][j] = (dp[i + 1][j] - a[i]) < (dp[i][j - 1] - a[j - 1])
? (dp[i + 1][j] - a[i])
: (dp[i][j - 1] - a[j - 1]);
}
}
cout << dp[0][n] << endl;
for (int i = 0; i < n; i++) {
delete[] dp[i];
}
delete[] dp;
delete[] a;
return 0;
}
| #include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
int *a = new int[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long **dp = new long *[n + 1];
for (int i = 0; i <= n; i++) {
dp[i] = new long[n + 1];
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n; j++) {
dp[i][j] = 0;
// if (i == j)
// dp[i][j] = 0;
// else
// dp[i][j] = -1;
}
}
for (int len = 1; len <= n; len++) {
for (int i = 0; i + len <= n; i++) {
int j = i + len;
if ((n - len) % 2 == 0)
dp[i][j] = (dp[i + 1][j] + a[i]) > (dp[i][j - 1] + a[j - 1])
? (dp[i + 1][j] + a[i])
: (dp[i][j - 1] + a[j - 1]);
else
dp[i][j] = (dp[i + 1][j] - a[i]) < (dp[i][j - 1] - a[j - 1])
? (dp[i + 1][j] - a[i])
: (dp[i][j - 1] - a[j - 1]);
}
}
cout << dp[0][n] << endl;
for (int i = 0; i < n; i++) {
delete[] dp[i];
}
delete[] dp;
delete[] a;
return 0;
}
| [] | 979,763 | 979,764 | u534223360 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<vector<ll>> v[2];
ll f(ll a[], ll n, ll i, ll j, ll turn) {
if (i == n || j == -1) {
return 0;
}
if (v[turn][i][j] != 0) {
return v[turn][i][j];
}
if (turn == 0) {
ll x = 0, y = 0;
y = f(a, n, i + 1, j, 1) + a[i];
x = f(a, n, i, j - 1, 1) + a[j];
v[turn][i][j] = max(x, y);
} else {
ll x = 0, y = 0;
y = f(a, n, i + 1, j, 0) - a[i];
x = f(a, n, i, j - 1, 0) - a[j];
v[turn][i][j] = min(x, y);
}
return v[turn][i][j];
}
int main() {
ll n, i, j, k;
cin >> n;
ll a[n];
vector<ll> tmp(n + 1, 0);
for (i = 0; i < n; i++) {
cin >> a[i];
v[0].push_back(tmp);
v[1].push_back(tmp);
}
cout << f(a, n, 0, n - 1, 0);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<vector<ll>> v[2];
ll f(ll a[], ll n, ll i, ll j, ll turn) {
if (i == n || j == -1 || i > j) {
return 0;
}
if (v[turn][i][j] != 0) {
return v[turn][i][j];
}
if (turn == 0) {
ll x = 0, y = 0;
y = f(a, n, i + 1, j, 1) + a[i];
x = f(a, n, i, j - 1, 1) + a[j];
v[turn][i][j] = max(x, y);
} else {
ll x = 0, y = 0;
y = f(a, n, i + 1, j, 0) - a[i];
x = f(a, n, i, j - 1, 0) - a[j];
v[turn][i][j] = min(x, y);
}
return v[turn][i][j];
}
int main() {
ll n, i, j, k;
cin >> n;
ll a[n];
vector<ll> tmp(n + 1, 0);
for (i = 0; i < n; i++) {
cin >> a[i];
v[0].push_back(tmp);
v[1].push_back(tmp);
}
cout << f(a, n, 0, n - 1, 0);
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 979,765 | 979,766 | u273273876 | cpp |
p03171 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define endl '\n'
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll memo[3001][3001], arr[3001];
int a;
ll solve(int s, int e) {
if (s > e)
return 0;
ll &cur = memo[s][e];
if (cur != -1)
return cur;
cur = 0;
if (s == e)
return arr[s];
cur = max(arr[s] - solve(s + 1, e), arr[e] - solve(s, e - 1));
return cur;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
memset(memo, -1, sizeof(memo));
cin >> a;
for (int i = 0; i < a; i++)
cin >> arr[i];
cout << solve(0, a - 1);
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define endl '\n'
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll memo[3001][3001], arr[3001];
int a;
ll solve(int s, int e) {
if (s > e)
return 0;
ll &cur = memo[s][e];
if (cur != -1)
return cur;
if (s == e)
return arr[s];
cur = max(arr[s] - solve(s + 1, e), arr[e] - solve(s, e - 1));
return cur;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
memset(memo, -1, sizeof(memo));
cin >> a;
for (int i = 0; i < a; i++)
cin >> arr[i];
cout << solve(0, a - 1);
} | [] | 979,767 | 979,768 | u366023106 | cpp |
p03171 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll n;
cin >> n;
vl a(n);
rep(i, n) { cin >> a[i]; }
vvl dp(
n + 1,
vl(n + 1)); // dp[l][r] :
// 区間a[l]～a[r-1]から始めて二人が最適に行動したときのx-yの値
exrep(len, 1, n) {
for (ll l = 0; l + len <= n; l++) {
ll r = l + len;
// 先手
if ((n - len) % 2 == 0) {
dp[l][r] = max(dp[l + 1][r] + a[l], dp[l][r - 1] + a[r - 1]);
}
// 後手
else {
dp[l][r] = max(dp[l + 1][r] - a[l], dp[l][r - 1] - a[r - 1]);
}
}
}
out(dp[0][n]);
re0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll n;
cin >> n;
vl a(n);
rep(i, n) { cin >> a[i]; }
vvl dp(n + 1,
vl(n + 1)); // dp[l][r] :
// aの区間[l,r)から始めて二人が最適に行動したときのx-yの値
exrep(len, 1, n) {
for (ll l = 0; l + len <= n; l++) {
ll r = l + len;
// 先手
if ((n - len) % 2 == 0) {
dp[l][r] = max(dp[l + 1][r] + a[l], dp[l][r - 1] + a[r - 1]);
}
// 後手
else {
dp[l][r] = min(dp[l + 1][r] - a[l], dp[l][r - 1] - a[r - 1]);
}
}
}
out(dp[0][n]);
re0;
} | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 979,771 | 979,772 | u828388155 | cpp |
p03171 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll n;
cin >> n;
vl a(n);
rep(i, n) { cin >> a[i]; }
vvl dp(
n + 1,
vl(n + 1)); // dp[l][r] :
// 区間a[l]～a[r-1]から始めて二人が最適に行動したときのx-yの値
exrep(len, 1, n) {
for (ll l = 0; l + len <= n; l++) {
ll r = l + len;
// 先手
if ((n - len) % 2 == 0) {
dp[l][r] = max(dp[l + 1][r] + a[l], dp[l][r - 1] + a[r - 1]);
}
// 後手
else {
dp[l][r] = max(dp[l + 1][r] - a[l], dp[l][r - 1] - a[r - 1]);
}
}
}
out(dp[0][n]);
re0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll n;
cin >> n;
vl a(n);
rep(i, n) { cin >> a[i]; }
vvl dp(
n + 1,
vl(n + 1)); // dp[l][r] :
// 区間a[l]～a[r-1]から始めて二人が最適に行動したときのx-yの値
exrep(len, 1, n) {
for (ll l = 0; l + len <= n; l++) {
ll r = l + len;
// 先手
if ((n - len) % 2 == 0) {
dp[l][r] = max(dp[l + 1][r] + a[l], dp[l][r - 1] + a[r - 1]);
}
// 後手
else {
dp[l][r] = min(dp[l + 1][r] - a[l], dp[l][r - 1] - a[r - 1]);
}
}
}
out(dp[0][n]);
re0;
} | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 979,771 | 979,773 | u828388155 | cpp |
p03171 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll n;
cin >> n;
vl a(n);
rep(i, n) { cin >> a[i]; }
vvl dp(
n,
vl(n + 1)); // dp[i][j] :
// 区間a[i]～a[j-1]から始めて二人が最適に行動したときのx-yの値
exrep(len, 1, n) {
for (ll i = 0; i + len <= n; i++) {
ll j = i + len;
// 先手
if ((n - len) % 2 == 0) {
dp[i][j] = max(dp[i + 1][j] + a[i], dp[i][j - 1] + a[j - 1]);
}
// 後手
else {
dp[i][j] = min(dp[i + 1][j] - a[i], dp[i][j - 1] - a[j - 1]);
}
}
}
out(dp[0][n]);
re0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll n;
cin >> n;
vl a(n);
rep(i, n) { cin >> a[i]; }
vvl dp(
n + 1,
vl(n + 1)); // dp[i][j] :
// 区間a[i]～a[j-1]から始めて二人が最適に行動したときのx-yの値
exrep(len, 1, n) {
for (ll i = 0; i + len <= n; i++) {
ll j = i + len;
// 先手
if ((n - len) % 2 == 0) {
dp[i][j] = max(dp[i + 1][j] + a[i], dp[i][j - 1] + a[j - 1]);
}
// 後手
else {
dp[i][j] = min(dp[i + 1][j] - a[i], dp[i][j - 1] - a[j - 1]);
}
}
}
out(dp[0][n]);
re0;
} | [
"assignment.change"
] | 979,774 | 979,775 | u828388155 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
int n;
ll *a, **dp;
int recur(int i, int j) {
if (i == j)
return a[i];
if (dp[i][j])
return dp[i][j];
return dp[i][j] = max(a[i] - recur(i + 1, j), a[j] - recur(i, j - 1));
}
int main() {
cin >> n;
a = new ll[n];
dp = new ll *[n];
for (int i = 0; i < n; i++)
dp[i] = new ll[n];
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
dp[i][j] = 0;
for (int i = 0; i < n; i++)
cin >> a[i];
cout << recur(0, n - 1);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
int n;
ll *a, **dp;
ll recur(int i, int j) {
if (i == j)
return a[i];
if (dp[i][j])
return dp[i][j];
return dp[i][j] = max(a[i] - recur(i + 1, j), a[j] - recur(i, j - 1));
}
int main() {
cin >> n;
a = new ll[n];
dp = new ll *[n];
for (int i = 0; i < n; i++)
dp[i] = new ll[n];
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
dp[i][j] = 0;
for (int i = 0; i < n; i++)
cin >> a[i];
cout << recur(0, n - 1);
return 0;
} | [] | 979,780 | 979,781 | u093929604 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
int n;
int *a, **dp;
int recur(int i, int j) {
if (i == j)
return a[i];
if (dp[i][j])
return dp[i][j];
return dp[i][j] = max(a[i] - recur(i + 1, j), a[j] - recur(i, j - 1));
}
int main() {
cin >> n;
a = new int[n];
dp = new int *[n];
for (int i = 0; i < n; i++)
dp[i] = new int[n];
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
dp[i][j] = 0;
for (int i = 0; i < n; i++)
cin >> a[i];
cout << recur(0, n - 1);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
int n;
ll *a, **dp;
ll recur(int i, int j) {
if (i == j)
return a[i];
if (dp[i][j])
return dp[i][j];
return dp[i][j] = max(a[i] - recur(i + 1, j), a[j] - recur(i, j - 1));
}
int main() {
cin >> n;
a = new ll[n];
dp = new ll *[n];
for (int i = 0; i < n; i++)
dp[i] = new ll[n];
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
dp[i][j] = 0;
for (int i = 0; i < n; i++)
cin >> a[i];
cout << recur(0, n - 1);
return 0;
} | [
"variable_declaration.type.change",
"assignment.value.change"
] | 979,782 | 979,781 | u093929604 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
int n;
int dp[3100][3100];
int a[3100];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int r = 1; r <= n; r++) {
for (int l = r; l >= 1; l--) {
dp[r][l] = max(a[l] - dp[r][l + 1], a[r] - dp[r - 1][l]);
}
}
cout << dp[n][1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int n;
long long dp[3100][3100];
long long a[3100];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int r = 1; r <= n; r++) {
for (int l = r; l >= 1; l--) {
dp[r][l] = max(a[l] - dp[r][l + 1], a[r] - dp[r - 1][l]);
}
}
cout << dp[n][1] << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 979,783 | 979,784 | u064458730 | cpp |
p03171 | #include <bits/stdc++.h>
#define pb push_back
#define INF 0x3f3f3f3
#define LINF 0x3f3f3f3f3f3f3f
#define MAXN int(3005)
#define fim '\n'
#define ll long long
#define f first
#define s second
#define FAST cin.tie(0), cout.tie(0), ios::sync_with_stdio(0)
#define debug(x) cout << "DEBUG " << x << fim
#define debug2(x, y) cout << "DEBUG " << x << " " << y << fim
#define debug3(x, y, z) cout << "DEBUG " << x << " " << y << " " << z << fim
#define max3(x, y, z) max(x, max(y, z))
using namespace std;
typedef pair<int, int> pii;
typedef pair<string, int> psi;
typedef pair<int, pair<int, int>> piii;
int dp[MAXN][MAXN], n, vet[MAXN], paro;
int solve(int l, int r) {
if (l > r)
return 0;
if (dp[l][r] != -INF)
return dp[l][r];
if (((l + r) % 2) == paro)
return dp[l][r] = max(solve(l + 1, r) + vet[l], solve(l, r - 1) + vet[r]);
else
return dp[l][r] = min(solve(l + 1, r) - vet[l], solve(l, r - 1) - vet[r]);
}
int main() {
FAST;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> vet[i];
for (int i = 0; i < MAXN; i++)
for (int j = 0; j < MAXN; j++)
dp[i][j] = -INF;
paro = (n % 2 == 0 ? 1 : 0);
cout << solve(1, n) << fim;
}
| #include <bits/stdc++.h>
#define pb push_back
#define INF 0x3f3f3f3
#define LINF 0x3f3f3f3f3f3f3f
#define MAXN int(3005)
#define fim '\n'
#define ll long long
#define f first
#define s second
#define FAST cin.tie(0), cout.tie(0), ios::sync_with_stdio(0)
#define debug(x) cout << "DEBUG " << x << fim
#define debug2(x, y) cout << "DEBUG " << x << " " << y << fim
#define debug3(x, y, z) cout << "DEBUG " << x << " " << y << " " << z << fim
#define max3(x, y, z) max(x, max(y, z))
using namespace std;
typedef pair<int, int> pii;
typedef pair<string, int> psi;
typedef pair<int, pair<int, int>> piii;
ll dp[MAXN][MAXN], n, vet[MAXN], paro;
ll solve(int l, int r) {
if (l > r)
return 0;
if (dp[l][r] != -INF)
return dp[l][r];
if (((l + r) % 2) == paro)
return dp[l][r] = max(solve(l + 1, r) + vet[l], solve(l, r - 1) + vet[r]);
else
return dp[l][r] = min(solve(l + 1, r) - vet[l], solve(l, r - 1) - vet[r]);
}
int main() {
FAST;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> vet[i];
for (int i = 0; i < MAXN; i++)
for (int j = 0; j < MAXN; j++)
dp[i][j] = -INF;
paro = (n % 2 == 0 ? 1 : 0);
cout << solve(1, n) << fim;
}
| [
"variable_declaration.type.change"
] | 979,785 | 979,786 | u562998528 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
const int N = 3e3 + 5;
ll a[N], dp[N][N];
int main() {
int n, i, j, L, R;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%lld", a[i]);
for (L = n; i >= 1; L--) {
for (R = L; R <= n; R++) {
dp[L][R] = max(a[L] - dp[L + 1][R], a[R] - dp[L][R - 1]);
}
}
printf("%lld\n", dp[1][n]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
const int N = 3e3 + 5;
ll a[N], dp[N][N];
int main() {
int n, i, j, L, R;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%lld", &a[i]);
for (L = n; L >= 1; L--) {
for (R = L; R <= n; R++) {
dp[L][R] = max(a[L] - dp[L + 1][R], a[R] - dp[L][R - 1]);
}
}
printf("%lld\n", dp[1][n]);
return 0;
} | [
"expression.operation.unary.reference.add",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 979,799 | 979,800 | u856968104 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define anuj \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) for (int i = k; i < n; i++)
#define ll long long int
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%I64d", &x)
#define ss(s) scanf("%s", s)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define clr(x) memset(x, 0, sizeof(x))
#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
#define endl '\n'
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
const int mod = 1000000007;
const int N = 2e5;
const int LG = 20;
int a[N];
int main() {
anuj;
int n;
cin >> n;
ll sum = 0;
fo(i, n) {
cin >> a[i];
sum += a[i];
}
ll dp[n][n];
for (int gap = 0; gap < n; gap++) {
for (int i = 0, j = gap; j < n; i++, j++) {
int x = i + 2 <= j ? dp[i + 2][j] : 0;
int y = ((i + 1) <= (j - 1)) ? dp[i + 1][j - 1] : 0;
int z = i <= j - 2 ? dp[i][j - 2] : 0;
dp[i][j] = max(a[i] + min(x, y), a[j] + min(y, z));
}
}
cout << 2 * dp[0][n - 1] - sum;
;
}
| #include <bits/stdc++.h>
using namespace std;
#define anuj \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) for (int i = k; i < n; i++)
#define ll long long int
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%I64d", &x)
#define ss(s) scanf("%s", s)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define clr(x) memset(x, 0, sizeof(x))
#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
#define endl '\n'
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
const int mod = 1000000007;
const int N = 2e5;
const int LG = 20;
int a[N];
int main() {
anuj;
int n;
cin >> n;
ll sum = 0;
fo(i, n) {
cin >> a[i];
sum += a[i];
}
ll dp[n][n];
for (int gap = 0; gap < n; gap++) {
for (int i = 0, j = gap; j < n; i++, j++) {
ll x = i + 2 <= j ? dp[i + 2][j] : 0;
ll y = ((i + 1) <= (j - 1)) ? dp[i + 1][j - 1] : 0;
ll z = i <= j - 2 ? dp[i][j - 2] : 0;
dp[i][j] = max(a[i] + min(x, y), a[j] + min(y, z));
}
}
cout << 2 * dp[0][n - 1] - sum;
;
}
| [
"variable_declaration.type.change"
] | 979,803 | 979,804 | u494437461 | cpp |
p03171 | #include <bits/stdc++.h>
#define ll long long
#define re register
#define IL inline
using namespace std;
const int maxn = 3e3 + 10;
template <typename T> void read(T &x) {
T f = 1;
x = 0;
char s = getchar();
while (s < '0' || s > '9') {
if (s == '-')
f = -1;
s = getchar();
}
while (s >= '0' && s <= '9') {
x = (x << 3) + (x << 1) + s - 48;
s = getchar();
}
x *= f;
}
int n;
int a[maxn];
int f[maxn][maxn];
int main() {
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
read(n);
for (re int i = 1; i <= n; i++) {
read(a[i]);
if (n & 1) {
f[i][i] = a[i];
} else
f[i][i] = -a[i];
}
for (re int i = 1; i <= n; i++) {
for (re int j = 1; j <= n - i; j++) {
if ((n - i - 1) & 1)
f[j][i + j] = min(f[j + 1][i + j] - a[j], f[j][i + j - 1] - a[i + j]);
else
f[j][i + j] = max(f[j + 1][i + j] + a[j], f[j][i + j - 1] + a[i + j]);
}
}
cout << f[1][n] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define re register
#define IL inline
using namespace std;
const int maxn = 3e3 + 10;
template <typename T> void read(T &x) {
T f = 1;
x = 0;
char s = getchar();
while (s < '0' || s > '9') {
if (s == '-')
f = -1;
s = getchar();
}
while (s >= '0' && s <= '9') {
x = (x << 3) + (x << 1) + s - 48;
s = getchar();
}
x *= f;
}
int n;
ll a[maxn];
ll f[maxn][maxn];
int main() {
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
read(n);
for (re int i = 1; i <= n; i++) {
read(a[i]);
if (n & 1) {
f[i][i] = a[i];
} else
f[i][i] = -a[i];
}
for (re int i = 1; i < n; i++) {
for (re int j = 1; j <= n - i; j++) {
if ((n - i - 1) & 1)
f[j][i + j] = min(f[j + 1][i + j] - a[j], f[j][i + j - 1] - a[i + j]);
else
f[j][i + j] = max(f[j + 1][i + j] + a[j], f[j][i + j - 1] + a[i + j]);
}
}
cout << f[1][n] << endl;
return 0;
}
| [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 979,811 | 979,812 | u343169347 | cpp |
p03171 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define ii pair<int, int>
#define fi first
#define se second
#define ll unsigned long long
int a[3001];
ll f[3002][3002];
ll s[3002];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
// freopen("Test.inp", "r", stdin);
// freopen("Test.out", "w", stdout);
int n;
cin >> n;
rep(i, 1, n) cin >> a[i];
rep(i, 1, n) f[i][i] = a[i];
rep(i, 1, n) s[i] = a[i] + s[i - 1];
for (int i = n - 1; i; i--) {
rep(j, i + 1, n) {
f[i][j] = s[j] - s[i - 1] - min(f[i + 1][j], f[i][j - 1]);
}
}
// rep(i,1,n){
// rep(j,1,n) cout<<f[i][j]<<' ';
// cout<<endl;
// }
cout << 2ll * f[1][n] - s[n];
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define ii pair<int, int>
#define fi first
#define se second
#define ll long long
int a[3001];
ll f[3002][3002];
ll s[3002];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
// freopen("Test.inp", "r", stdin);
// freopen("Test.out", "w", stdout);
int n;
cin >> n;
rep(i, 1, n) cin >> a[i];
rep(i, 1, n) f[i][i] = a[i];
rep(i, 1, n) s[i] = a[i] + s[i - 1];
for (int i = n - 1; i; i--) {
rep(j, i + 1, n) {
f[i][j] = s[j] - s[i - 1] - min(f[i + 1][j], f[i][j - 1]);
}
}
// rep(i,1,n){
// rep(j,1,n) cout<<f[i][j]<<' ';
// cout<<endl;
// }
cout << 2ll * f[1][n] - s[n];
return 0;
}
| [] | 979,823 | 979,824 | u091780713 | cpp |
p03171 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define ii pair<int, int>
#define fi first
#define se second
#define ll unsigned long long
int a[3001];
ll f[3002][3002];
ll s[3002];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
// freopen("Test.inp", "r", stdin);
// freopen("Test.out", "w", stdout);
int n;
cin >> n;
rep(i, 1, n) cin >> a[i];
rep(i, 1, n) f[i][i] = a[i];
rep(i, 1, n) s[i] = a[i] + s[i - 1];
for (int i = n - 1; i; i--) {
rep(j, i + 1, n) {
f[i][j] = s[j] - s[i - 1] - min(f[i + 1][j], f[i][j - 1]);
}
}
// rep(i,1,n){
// rep(j,1,n) cout<<f[i][j]<<' ';
// cout<<endl;
// }
cout << 2 * f[1][n] - s[n];
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define ii pair<int, int>
#define fi first
#define se second
#define ll long long
int a[3001];
ll f[3002][3002];
ll s[3002];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
// freopen("Test.inp", "r", stdin);
// freopen("Test.out", "w", stdout);
int n;
cin >> n;
rep(i, 1, n) cin >> a[i];
rep(i, 1, n) f[i][i] = a[i];
rep(i, 1, n) s[i] = a[i] + s[i - 1];
for (int i = n - 1; i; i--) {
rep(j, i + 1, n) {
f[i][j] = s[j] - s[i - 1] - min(f[i + 1][j], f[i][j - 1]);
}
}
// rep(i,1,n){
// rep(j,1,n) cout<<f[i][j]<<' ';
// cout<<endl;
// }
cout << 2ll * f[1][n] - s[n];
return 0;
}
| [] | 979,825 | 979,824 | u091780713 | cpp |
p03171 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define endl '\n'
#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
using namespace std;
int main() {
cin.tie(NULL);
ios::sync_with_stdio(false);
// insert code
int n;
cin >> n;
vi a(n);
rep(i, 0, n) cin >> a[i];
vector<vector<int>> dp(n, vector<int>(n));
for (int i = n - 1; i >= 0; i--) {
for (int j = i; j < n; j++) {
if (i == j)
dp[i][j] = a[i];
else {
dp[i][j] = max(a[i] - dp[i + 1][j], a[j] - dp[i][j - 1]);
}
}
}
cout << dp[0][n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define endl '\n'
#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
using namespace std;
int main() {
cin.tie(NULL);
ios::sync_with_stdio(false);
// insert code
int n;
cin >> n;
vi a(n);
rep(i, 0, n) cin >> a[i];
vector<vector<ll>> dp(n, vector<ll>(n));
for (int i = n - 1; i >= 0; i--) {
for (int j = i; j < n; j++) {
if (i == j)
dp[i][j] = a[i];
else {
dp[i][j] = max(a[i] - dp[i + 1][j], a[j] - dp[i][j - 1]);
}
}
}
cout << dp[0][n - 1] << endl;
return 0;
} | [] | 979,828 | 979,829 | u054956994 | cpp |
p03171 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
vector<long long> a;
vector<vector<long long>> dp;
long long sa(long long b, long long e) {
if (dp[b][e] != INFINITY)
return dp[b][e];
if (b == e)
return a[b];
if (e - b == 1) {
return abs(a[e] - a[b]);
}
long long tmp1, tmp2;
tmp1 = min(a[b] - a[b + 1] + sa(b + 2, e), a[b] - a[e] + sa(b + 1, e - 1));
tmp2 = min(a[e] - a[b] + sa(b + 1, e - 1), a[e] - a[e - 1] + sa(b, e - 2));
dp[b][e] = max(tmp1, tmp2);
return dp[b][e];
}
int main() {
ios::sync_with_stdio(false);
long long n;
cin >> n;
a = vector<long long>(n);
dp = vector<vector<long long>>(n, vector<long long>(n, INFINITY));
for (long long i = 0; i < n; i++) {
cin >> a[i];
}
cout << sa(0, n - 1) << endl;
return 0;
}
| #include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
vector<long long> a;
vector<vector<long long>> dp;
long long sa(long long b, long long e) {
if (dp[b][e] != 1000000000)
return dp[b][e];
if (b == e)
return a[b];
if (e - b == 1) {
return abs(a[e] - a[b]);
}
long long tmp1, tmp2;
tmp1 = min(a[b] - a[b + 1] + sa(b + 2, e), a[b] - a[e] + sa(b + 1, e - 1));
tmp2 = min(a[e] - a[b] + sa(b + 1, e - 1), a[e] - a[e - 1] + sa(b, e - 2));
dp[b][e] = max(tmp1, tmp2);
return dp[b][e];
}
int main() {
ios::sync_with_stdio(false);
long long n;
cin >> n;
a = vector<long long>(n);
dp = vector<vector<long long>>(n, vector<long long>(n, 1000000000));
for (long long i = 0; i < n; i++) {
cin >> a[i];
}
cout << sa(0, n - 1) << endl;
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change"
] | 979,834 | 979,835 | u834415466 | cpp |
p03171 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <tuple>
#include <vector>
using namespace std;
#define INF 1100000000000
#define MAX 1100000
#define MOD 1000000007
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<pair<int, int>, int> p;
typedef pair<pair<int, int>, int> p;
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
ll dp[3100][3100], a[3100];
bool flag[3100][3100];
int f(int l, int r) {
if (flag[l][r])
return dp[l][r];
flag[l][r] = true;
if (l == r)
return dp[l][r] = a[l];
return dp[l][r] = max(a[l] - f(l + 1, r), a[r] - f(l, r - 1));
}
int main() {
int N;
cin >> N;
for (int i = 0; i < 3100; i++) {
for (int j = 0; j < 3100; j++) {
flag[i][j] = false;
}
}
for (int i = 0; i < N; i++)
cin >> a[i];
ll ans = f(0, N - 1);
cout << ans << endl;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <tuple>
#include <vector>
using namespace std;
#define INF 1100000000000
#define MAX 1100000
#define MOD 1000000007
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<pair<int, int>, int> p;
typedef pair<pair<int, int>, int> p;
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
ll dp[3100][3100], a[3100];
bool flag[3100][3100];
ll f(int l, int r) {
if (flag[l][r])
return dp[l][r];
flag[l][r] = true;
if (l == r)
return dp[l][r] = a[l];
return dp[l][r] = max(a[l] - f(l + 1, r), a[r] - f(l, r - 1));
}
int main() {
int N;
cin >> N;
for (int i = 0; i < 3100; i++) {
for (int j = 0; j < 3100; j++) {
flag[i][j] = false;
}
}
for (int i = 0; i < N; i++)
cin >> a[i];
ll ans = f(0, N - 1);
cout << ans << endl;
}
| [] | 979,836 | 979,837 | u591914971 | cpp |
p03171 | #include <iostream>
using namespace std;
int n, i, a[3001], d[3001][3001], k;
int main() {
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i];
d[i][i] = a[i];
}
for (k = 2; k <= n; k++) {
for (i = 1; i <= n - k + 1; i++) {
d[i][i + k - 1] =
max(a[i] - d[i + 1][i + k - 1], a[i + k - 1] - d[i][i + k - 2]);
}
}
cout << d[1][n];
return 0;
}
| #include <iostream>
using namespace std;
long long n, i, a[3005], d[3005][3005], k;
int main() {
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i];
d[i][i] = a[i];
}
for (k = 2; k <= n; k++) {
for (i = 1; i <= n - k + 1; i++) {
d[i][i + k - 1] =
max(a[i] - d[i + 1][i + k - 1], a[i + k - 1] - d[i][i + k - 2]);
}
}
cout << d[1][n];
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 979,838 | 979,839 | u283337016 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define y1 as214
#define ii pair<int, int>
#define iii pair<int, ii>
#define iv pair<ii, ii>
#define fi first
#define se second
#define fr front()
#define pb push_back
#define FOR(i, x, n) for (int i = x; i <= n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FORD(i, x, n) for (int i = x; i >= n; --i)
#define ll long long
#define oo 2e9
#define int long long
#define pow poww
const int N = 3e3 + 5;
int n, sum;
int a[N];
int dp[N][N];
main() {
// freopen("TROCHOI.inp","r",stdin);
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
FOR(i, 1, n) {
cin >> a[i];
sum += a[i];
}
FOR(i, 1, n)
dp[i][i] = a[i];
FOR(i, 1, n - 1)
dp[i][i + 1] = max(a[i], a[i + 1]);
FOR(r, 1, n) {
FOR(l, 1, r - 2)
dp[l][r] = max(min(dp[l + 2][r], dp[l + 1][r - 1]) + a[l],
min(dp[l + 1][r - 1], dp[l][r - 2]) + a[r]);
}
cout << dp[1][n] - (sum - dp[1][n]);
}
| #include <bits/stdc++.h>
using namespace std;
#define y1 as214
#define ii pair<int, int>
#define iii pair<int, ii>
#define iv pair<ii, ii>
#define fi first
#define se second
#define fr front()
#define pb push_back
#define FOR(i, x, n) for (int i = x; i <= n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FORD(i, x, n) for (int i = x; i >= n; --i)
#define ll long long
#define oo 2e9
#define int long long
#define pow poww
const int N = 3e3 + 5;
int n, sum;
int a[N];
int dp[N][N];
main() {
// freopen("TROCHOI.inp","r",stdin);
// freopen("TROCHOI.out","w",stdout);
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
FOR(i, 1, n) {
cin >> a[i];
sum += a[i];
}
FOR(i, 1, n)
dp[i][i] = a[i];
FOR(i, 1, n - 1)
dp[i][i + 1] = max(a[i], a[i + 1]);
FOR(r, 1, n) {
FORD(l, r - 2, 1)
dp[l][r] = max(min(dp[l + 2][r], dp[l + 1][r - 1]) + a[l],
min(dp[l + 1][r - 1], dp[l][r - 2]) + a[r]);
}
cout << dp[1][n] - (sum - dp[1][n]);
}
| [
"assignment.variable.change",
"identifier.change",
"call.function.change",
"call.arguments.change",
"call.arguments.add"
] | 979,842 | 979,841 | u812951529 | cpp |
p03171 | #include <cstring>
#include <iostream>
using namespace std;
int n, arr[3001], dp[3001][3001][2];
int recursive(int l, int r, int tur) {
if (dp[l][r][tur] != -1)
return dp[l][r][tur];
if (l == r && tur == 1)
return arr[l];
if (l == r && tur == 2)
return -arr[l];
if (tur == 1)
dp[l][r][tur] =
max(recursive(l + 1, r, 2) + arr[l], recursive(l, r - 1, 2) + arr[r]);
if (tur == 2)
dp[l][r][tur] =
min(recursive(l + 1, r, 1) - arr[l], recursive(l, r - 1, 1) - arr[r]);
return dp[l][r][tur];
}
int main(void) {
cin >> n;
memset(dp, -1, sizeof(dp));
for (int i = 0; i < n; i++)
cin >> arr[i];
cout << recursive(0, n - 1, 1);
return 0;
}
| #include <cstring>
#include <iostream>
using namespace std;
long long int n, arr[3001], dp[3001][3001][2];
long long int recursive(int l, int r, int tur) {
if (dp[l][r][tur] != -1)
return dp[l][r][tur];
if (l == r && tur == 1)
return arr[l];
if (l == r && tur == 2)
return -arr[l];
if (tur == 1)
dp[l][r][tur] =
max(recursive(l + 1, r, 2) + arr[l], recursive(l, r - 1, 2) + arr[r]);
if (tur == 2)
dp[l][r][tur] =
min(recursive(l + 1, r, 1) - arr[l], recursive(l, r - 1, 1) - arr[r]);
return dp[l][r][tur];
}
int main(void) {
cin >> n;
memset(dp, -1, sizeof(dp));
for (int i = 0; i < n; i++)
cin >> arr[i];
cout << recursive(0, n - 1, 1);
return 0;
} | [
"variable_declaration.type.widen.change"
] | 979,845 | 979,846 | u768735561 | cpp |
p03171 | #include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> arr(n + 1, 0);
for (int i = 0; i < n; i++) {
std::cin >> arr[i];
}
int dp[n + 2][n + 2] = {0};
for (int i = n - 1; i >= 0; i--) {
for (int j = i; j < n; j++) {
if (i == j) {
dp[i][j] = arr[i];
} else {
dp[i][j] = std::max(arr[i] - dp[i + 1][j], arr[j] - dp[i][j - 1]);
}
}
}
std::cout << dp[0][n - 1];
return 0;
} | #include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<long long> arr(n + 1, 0);
for (int i = 0; i < n; i++) {
std::cin >> arr[i];
}
long long dp[n + 2][n + 2] = {0};
for (int i = n - 1; i >= 0; i--) {
for (int j = i; j < n; j++) {
if (i == j) {
dp[i][j] = arr[i];
} else {
dp[i][j] = std::max(arr[i] - dp[i + 1][j], arr[j] - dp[i][j - 1]);
}
}
}
std::cout << dp[0][n - 1];
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 979,849 | 979,850 | u290926443 | cpp |
p03171 | #include <bits/stdc++.h>
#define mp make_pair
#define f first
#define se second
#define pb push_back
#define ms memset
#define MOD 1000000007
#define sp fixed << setprecision
#define sz sizeof
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
bool pr[1000007];
ll fpow(ll x, ll y) {
x = x % MOD;
ll res = 1;
while (y) {
if (y & 1)
res = res * x;
res %= MOD;
y = y >> 1;
x = x * x;
x %= MOD;
}
return res;
}
ll inv(ll a, ll m = MOD) {
ll c = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
ll q = a / m;
ll t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += c;
return x;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
ll a[n];
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
ll dp[n][n];
for (int i = n - 1; i >= 0; i--) {
for (int j = i; j < n; j++) {
if (i == j)
dp[i][j] = a[i];
else if (j == i - 1)
dp[i][j] = max(a[i], a[j]);
else {
ll choice1 = a[i] + min(dp[i + 2][j], dp[i + 1][j - 1]);
ll choice2 = a[j] + min(dp[i][j - 2], dp[i + 1][j - 1]);
dp[i][j] = max(choice1, choice2);
}
}
}
cout << 2 * dp[0][n - 1] - sum;
}
| #include <bits/stdc++.h>
#define mp make_pair
#define f first
#define se second
#define pb push_back
#define ms memset
#define MOD 1000000007
#define sp fixed << setprecision
#define sz sizeof
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
bool pr[1000007];
ll fpow(ll x, ll y) {
x = x % MOD;
ll res = 1;
while (y) {
if (y & 1)
res = res * x;
res %= MOD;
y = y >> 1;
x = x * x;
x %= MOD;
}
return res;
}
ll inv(ll a, ll m = MOD) {
ll c = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
ll q = a / m;
ll t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += c;
return x;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
ll a[n];
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
ll dp[n][n];
for (int i = n - 1; i >= 0; i--) {
for (int j = i; j < n; j++) {
if (i == j)
dp[i][j] = a[i];
else if (j == i + 1)
dp[i][j] = max(a[i], a[j]);
else {
ll choice1 = a[i] + min(dp[i + 2][j], dp[i + 1][j - 1]);
ll choice2 = a[j] + min(dp[i][j - 2], dp[i + 1][j - 1]);
dp[i][j] = max(choice1, choice2);
}
}
}
cout << 2 * dp[0][n - 1] - sum;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 979,853 | 979,854 | u165403340 | cpp |
p03171 | #include <bits/stdc++.h>
using namespace std;
#define N (int)3e3 + 5
#define f1 first
#define s2 second
#define pb push_back
#define ll long long
#define mod (int)1e9
#define INF 99999999
#define ull unsigned long long
#define all(a) a.begin(), a.end()
#define fri(a) freopen((a), "r", stdin);
#define fro(a) freopen((a), "w", stdout);
int n, dizi[N], dp[N][N];
int dpf(int l, int r) {
if (dp[l][r] != -1)
return dp[l][r];
if (l > r)
return 0;
int ans1 = dpf(l + 1, r);
int ans2 = dpf(l, r - 1);
return dp[l][r] = max(dizi[l] - ans1, dizi[r] - ans2);
}
int main() {
// fri("in.txt");
// fro("out.txt");
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> dizi[i];
}
memset(dp, -1, sizeof(dp));
cout << dpf(1, n);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define N (int)3e3 + 5
#define f1 first
#define s2 second
#define pb push_back
#define ll long long
#define mod (int)1e9
#define INF 99999999
#define ull unsigned long long
#define all(a) a.begin(), a.end()
#define fri(a) freopen((a), "r", stdin);
#define fro(a) freopen((a), "w", stdout);
ll n, dizi[N], dp[N][N];
ll dpf(int l, int r) {
if (dp[l][r] != -1)
return dp[l][r];
if (l > r)
return 0;
ll ans1 = dpf(l + 1, r);
ll ans2 = dpf(l, r - 1);
return dp[l][r] = max(dizi[l] - ans1, dizi[r] - ans2);
}
int main() {
// fri("in.txt");
// fro("out.txt");
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> dizi[i];
}
memset(dp, -1, sizeof(dp));
cout << dpf(1, n);
return 0;
} | [
"variable_declaration.type.change"
] | 979,859 | 979,860 | u291900927 | cpp |
p03171 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using VL = vector<ll>;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
const long long INF = 999999999;
ll N, a[3010];
ll dp[3010][3010];
int main() {
cin >> N;
REP(i, N) { cin >> a[i]; }
REP(i, N + 1) { REP(j, N + 1) dp[i][j] = 0; }
for (int len = 1; len <= N; len++) {
for (int l = 0; l <= N - len; l++) {
int r = l + len;
if ((N - len) % 2 == 0) {
dp[l][r] = max(dp[l + 1][r] + a[l], dp[l][r - 1] + a[r]);
} else {
dp[l][r] = min(dp[l + 1][r] - a[l], dp[l][r - 1] - a[r - 1]);
}
}
}
cout << dp[0][N] << endl;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using VL = vector<ll>;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
const long long INF = 999999999;
ll N, a[3010];
ll dp[3010][3010];
int main() {
cin >> N;
REP(i, N) { cin >> a[i]; }
REP(i, N + 1) { REP(j, N + 1) dp[i][j] = 0; }
for (int len = 1; len <= N; len++) {
for (int l = 0; l <= N - len; l++) {
int r = l + len;
if ((N - len) % 2 == 0) {
dp[l][r] = max(dp[l + 1][r] + a[l], dp[l][r - 1] + a[r - 1]);
} else {
dp[l][r] = min(dp[l + 1][r] - a[l], dp[l][r - 1] - a[r - 1]);
}
}
}
cout << dp[0][N] << endl;
}
| [
"assignment.change"
] | 979,861 | 979,862 | u832095504 | cpp |
p03171 | #include <bits/stdc++.h>
#define NMAX 3005
using namespace std;
int n, a[NMAX], d[NMAX][NMAX];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
d[i][i] = a[i];
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= n - i + 1; j++) {
d[j][j + i - 1] =
max(a[j] - d[j + 1][j + i - 1], a[j + i - 1] - d[j][j + i - 2]);
}
}
cout << d[1][n];
return 0;
}
| #include <bits/stdc++.h>
#define NMAX 3005
using namespace std;
int n;
long long a[NMAX], d[NMAX][NMAX];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
d[i][i] = a[i];
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= n - i + 1; j++) {
d[j][j + i - 1] =
max(a[j] - d[j + 1][j + i - 1], a[j + i - 1] - d[j][j + i - 2]);
}
}
cout << d[1][n];
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 979,863 | 979,864 | u644497121 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.