Submission #1004459

#	Time	Username	Problem	Language	Result	Execution time	Memory
1004459		messiuuuuu	Žarulje (COI15_zarulje)	C++14	22 / 100	46 ms	29008 KiB

zarulje

#include <bits/stdc++.h>
using namespace std;

const int MAXN = 2e3 + 5;
const int MOD = 1e9 + 7;

int n, k;
int dp[MAXN][MAXN], a[MAXN];

int main()
{
    cin >> n >> k;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    a[0] = a[n + 1] = -2e9;
    dp[1][n] = 1;
    for (int le = n; le >= 1; le--)
    {
        for (int l = 1; l + le - 1 <= n; l++)
        {
            int r = l + le - 1;
            if (a[l - 1] > a[r + 1])
            {
                dp[l][r] += dp[l - 1][r];
                dp[l][r] %= MOD;
            }
            if (a[l - 1] < a[r + 1])
            {
                dp[l][r] += dp[l][r + 1];
                dp[l][r] %= MOD;
            }
            if (a[l - 1] == a[r + 1])
            {
                dp[l][r] += dp[l - 1][r];
                dp[l][r] %= MOD;
                 dp[l][r] += dp[l][r + 1];
                dp[l][r] %= MOD;
            }
        }
    }
    while (k-- > 0)
    {
        int p;
        cin >> p;
        cout << dp[p][p] << '\n';
    }
}

• Subtask 1: 22 / 22
• Subtask 2: 0 / 38
• Subtask 3: 0 / 40