#include<bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define mxn 502
#define pb push_back
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
using namespace std;
int dp[mxn][2],n,a[mxn],b[mxn],mod=1e9+7;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i]>>b[i];
dp[1][0]=1,dp[1][1]=1;
for(int i=2;i<=n;i++){
dp[i][0]=(dp[i-1][0]+dp[i-1][1])%mod;
dp[i][1]=1;
for(int j=1;j<i;j++){
if(a[i]>a[j]) dp[i][1]=(dp[i][1]+dp[j][1])%mod;
}
}
cout<<(dp[n][0]+dp[n][1]-1+mod)%mod;
}
# | 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... |