Submission #3499471


Source Code Expand

#include <cstdio>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <cmath>
#include <climits>

#define ll long long int
#define pb push_back
#define mk make_pair
#define pq priority_queue

using namespace std;
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
int inc[300001], des[300001];

int main(int argc, char const* argv[])
{
  int n;
  cin >> n;
  vector<int> h;
  for(int i = 0; i < n; i++){
    int x;
    cin >> x;
    h.pb(x);
  }
  inc[0] = 1;
  des[n - 1] = 1;
  for(int i = 1; i < n; i++){
    if(h[i] > h[i - 1])inc[i] = inc[i-1] + 1;
    else inc[i] = 1;
  }
  for(int i = n - 2; i >= 0; i--){
    if(h[i] > h[i + 1])des[i] = des[i+1] + 1;
    else des[i] = 1;
  }
  int res = 0;
  for(int i = 0; i < n; i++){
    res = max(res, inc[i] + des[i] - 1);
  }
  cout << res << endl;
	return 0;
}

Submission Info

Submission Time
Task B - 山のデータ
User fumiphys
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1129 Byte
Status AC
Exec Time 121 ms
Memory 3952 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 2
AC × 17
AC × 32
Set Name Test Cases
Sample subtask0-sample-01.txt, subtask0-sample-02.txt
Subtask1 subtask0-sample-01.txt, subtask0-sample-02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt
Subtask2 subtask0-sample-01.txt, subtask0-sample-02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask2-11.txt, subtask2-12.txt, subtask2-13.txt, subtask2-14.txt, subtask2-15.txt
Case Name Status Exec Time Memory
subtask0-sample-01.txt AC 1 ms 256 KB
subtask0-sample-02.txt AC 1 ms 256 KB
subtask1-01.txt AC 1 ms 256 KB
subtask1-02.txt AC 1 ms 256 KB
subtask1-03.txt AC 1 ms 256 KB
subtask1-04.txt AC 1 ms 256 KB
subtask1-05.txt AC 1 ms 256 KB
subtask1-06.txt AC 1 ms 256 KB
subtask1-07.txt AC 1 ms 256 KB
subtask1-08.txt AC 1 ms 256 KB
subtask1-09.txt AC 1 ms 256 KB
subtask1-10.txt AC 1 ms 256 KB
subtask1-11.txt AC 1 ms 256 KB
subtask1-12.txt AC 1 ms 256 KB
subtask1-13.txt AC 1 ms 256 KB
subtask1-14.txt AC 1 ms 256 KB
subtask1-15.txt AC 1 ms 256 KB
subtask2-01.txt AC 7 ms 512 KB
subtask2-02.txt AC 33 ms 1272 KB
subtask2-03.txt AC 61 ms 2164 KB
subtask2-04.txt AC 119 ms 3952 KB
subtask2-05.txt AC 120 ms 3824 KB
subtask2-06.txt AC 120 ms 3952 KB
subtask2-07.txt AC 121 ms 3824 KB
subtask2-08.txt AC 120 ms 3952 KB
subtask2-09.txt AC 119 ms 3952 KB
subtask2-10.txt AC 119 ms 3824 KB
subtask2-11.txt AC 121 ms 3824 KB
subtask2-12.txt AC 120 ms 3952 KB
subtask2-13.txt AC 121 ms 3824 KB
subtask2-14.txt AC 119 ms 3952 KB
subtask2-15.txt AC 121 ms 3952 KB