[HNOI2010]合唱队 - 洛谷https://www.luogu.com.cn/problem/P3205
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <unordered_map>
#include <cmath>
#include <map>
#include <cctype>
#include <cstdlib>
#include <deque>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))
const int mod = 19650827;
int f[2050][2050][2];
int a[MAXN];
int n;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
}
for (int i = 1; i <= n; i++) {
f[i][i][0] = 1;
}
for (int l = 1; l < n; l++) {
for (int i = 1; i <= n - l; i++) {
int j = l + i;
if (a[i] < a[i + 1])
f[i][j][0] += f[i + 1][j][0];
if (a[i] < a[j])
f[i][j][0] += f[i + 1][j][1];
if (a[j] > a[j - 1])
f[i][j][1] += f[i][j - 1][1];
if (a[j] > a[i])
f[i][j][1] += f[i][j - 1][0];
f[i][j][0] %= mod;
f[i][j][1] %= mod;
}
}
printf("%d", (f[1][n][0] + f[1][n][1]) % mod);
return 0;
}