#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int md = (int)1e9 + 7;
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i] >> a[i];
vector<vector<int>> dp(n, vector<int>(2));
dp[0][0] = dp[0][1] = 1;
for (int i = 1; i < n; i++) {
dp[i][0] = (dp[i - 1][0] + dp[i - 1][1]) % md;
dp[i][1] = 1;
for (int j = 0; j < i; j++)
if (a[j] < a[i]) dp[i][1] = (dp[i][1] + dp[j][1]) % md;
}
cout << (dp[n - 1][0] + dp[n - 1][1] - 1) % md;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |