제출 #557107

#제출 시각아이디문제언어결과실행 시간메모리
557107donaldchuityFinancial Report (JOI21_financial)C++17
0 / 100
4075 ms1364 KiB
#include<bits/stdc++.h>
using namespace std;
int main() {
  int n, d; cin >> n >> d;
  int a[n]; for (int i = 0; i < n; i++) cin >> a[i];
  int maxcount = 0;
  for (int i = 0; i < n-1; i++) {
    int maxi = a[i];
    int count = 1;
    for (int j = i+1; j < n; j++) {
      if (a[j] > maxi) {
        count++;
        maxi = a[j+1]; 
      }
    }
    maxcount = max(maxcount, count);
  }
  cout << maxcount+1 << endl;
  return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...