Submission #7252710


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;;
#define ll long long
#define rep(i, n) for(int i = 0;i < n;i++)
#define repr(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define INF 1<<30
#define LINF 1LL<<62
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
const int MOD = 1000000007;
 
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;


int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);
  ll n;cin >> n;
  vector<ll> h(n);
  rep(i,n){
      cin >> h[i];
  }
  ll ans = 0;
  ll tmp = 0;
  ll now = h[0];
  FOR(i,1,n){
      if(now>=h[i]){
          tmp++;
      }else{
          ans = max(ans,tmp);
          tmp = 0;
      }
      now = h[i];
  }
  ans = max(ans,tmp);
  cout << ans << endl;
}

Submission Info

Submission Time
Task C - Lower
User mathda1
Language C++14 (GCC 5.4.1)
Score 300
Code Size 854 Byte
Status AC
Exec Time 12 ms
Memory 1024 KB

Judge Result

Set Name All Sample
Score / Max Score 300 / 300 0 / 0
Status
AC × 18
AC × 3
Set Name Test Cases
All sample_01, sample_02, sample_03, testcase_01, testcase_02, testcase_03, testcase_04, testcase_05, testcase_06, testcase_07, testcase_08, testcase_09, testcase_10, testcase_11, testcase_12, testcase_13, testcase_14, testcase_15
Sample sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
sample_01 AC 1 ms 256 KB
sample_02 AC 1 ms 256 KB
sample_03 AC 1 ms 256 KB
testcase_01 AC 7 ms 768 KB
testcase_02 AC 12 ms 1024 KB
testcase_03 AC 11 ms 1024 KB
testcase_04 AC 2 ms 256 KB
testcase_05 AC 2 ms 384 KB
testcase_06 AC 7 ms 768 KB
testcase_07 AC 9 ms 896 KB
testcase_08 AC 11 ms 1024 KB
testcase_09 AC 2 ms 256 KB
testcase_10 AC 11 ms 1024 KB
testcase_11 AC 12 ms 1024 KB
testcase_12 AC 7 ms 1024 KB
testcase_13 AC 1 ms 256 KB
testcase_14 AC 9 ms 1024 KB
testcase_15 AC 9 ms 1024 KB