Submission #1348875

#	Time	Username	Problem	Language	Result	Execution time	Memory
1348875		ramzialoulou	Financial Report (JOI21_financial)	C++20	0 / 100	11 ms	1208 KiB

Main

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

const int N = int(2e5) + 9;
const int LOG = 20;
int a[N];
int dp[N];

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, d;
  cin >> n >> d;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < n; i++) {
    dp[i] = 1;
  }
  for (int i = 1; i < n; i++) {
    if (a[i - 1] < a[i]) {
      dp[i] = max(dp[i], dp[i - 1] + 1);
      if (i >= 2) {
        dp[i] = max(dp[i], dp[i - 2] + 1);
      }
    }
  }
  int ans = 0;
  for (int i = 0; i < n; i++) {
    ans = max(ans, dp[i]);
  }
  cout << ans << '\n';
  return 0;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 20
• Subtask 4: 0 / 12
• Subtask 5: 0 / 5
• Subtask 6: 0 / 35