제출 #849146

#제출 시각아이디문제언어결과실행 시간메모리
849146tch1cherinBoat (APIO16_boat)C++17
9 / 100
1 ms504 KiB
#include <bits/stdc++.h>
using namespace std;

const int MOD = 1e9 + 7;

void norm(int& X) {
  X -= X >= MOD ? MOD : 0;
}

int main() {
  int N;
  cin >> N;
  vector<int> A(N);
  for (int &v : A) {
    cin >> v >> v;
  }
  vector<int> dp(N + 1);
  dp[0] = 1;
  for (int i = 0; i < N; i++)
    for (int j = i; j >= 0; j--)
      if (j == 0 || A[i] > A[j - 1])
        norm(dp[i + 1] += dp[j]);
  
  int ans = 0;
  for (int i = 1; i <= N; i++) {
    norm(ans += dp[i]);
  }
  cout << ans << "\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...