This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define sz(x) (int)x.size()
#define ff first
#define ss second
const ll N = 505;
const ll M = 1e9 + 7;
int T, n, a[N], b[N], dp[N][5];
int main(){
ios::sync_with_stdio(false); cin.tie(0);
cin >> n;
for(int i = 1; i <= n; i++){
cin >> a[i] >> b[i];
}
int ans = 0;
for(int i = 1; i <= n; i++){
int mx = 0, mx1 = 0, mx2 = 0;
for(int j = 1; j < i; j++){
mx = max(mx,dp[j][0]);
mx1 = max(mx1,dp[j][1]);
if(a[j] < a[i]) mx2 = max(mx2,dp[j][1]);
}
dp[i][0] = max(mx1,mx);
dp[i][1] = mx2+1;
ans += dp[i][0];
ans += dp[i][1];
ans %= M;
dp[i][0] %= M;
dp[i][1] %= M;
}
cout << ans;
return 0;
}
# | 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... |