結果

問題 No.127 門松もどき
ユーザー fumiphysfumiphys
提出日時 2019-09-14 20:02:30
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 132 ms / 5,000 ms
コード長 3,712 bytes
コンパイル時間 1,779 ms
コンパイル使用メモリ 169,884 KB
実行使用メモリ 73,880 KB
最終ジャッジ日時 2024-07-06 12:17:13
合計ジャッジ時間 4,175 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 132 ms
73,016 KB
testcase_05 AC 3 ms
6,944 KB
testcase_06 AC 13 ms
26,780 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 AC 3 ms
6,944 KB
testcase_09 AC 3 ms
6,944 KB
testcase_10 AC 3 ms
6,944 KB
testcase_11 AC 4 ms
9,836 KB
testcase_12 AC 63 ms
56,832 KB
testcase_13 AC 93 ms
64,628 KB
testcase_14 AC 80 ms
62,704 KB
testcase_15 AC 110 ms
73,656 KB
testcase_16 AC 79 ms
61,304 KB
testcase_17 AC 83 ms
67,376 KB
testcase_18 AC 67 ms
60,244 KB
testcase_19 AC 41 ms
48,052 KB
testcase_20 AC 47 ms
48,696 KB
testcase_21 AC 20 ms
35,120 KB
testcase_22 AC 123 ms
73,052 KB
testcase_23 AC 121 ms
73,880 KB
testcase_24 AC 96 ms
67,956 KB
testcase_25 AC 115 ms
72,420 KB
testcase_26 AC 57 ms
54,224 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

int dpr[3010][3010], dpl[3010][3010];


int main(int argc, char const* argv[])
{
  int n;
  cin >> n;
  vector<int> a(n);
  cin >> a;
  for(int k = 0; k < n; k++){
    rep(l, n){
      int r = l + k;
      if(r >= n)continue;
      if(l == r)dpl[l][r] = 1;
      else if(a[l] >= a[r])dpl[l][r] = dpl[l][r-1];
      else dpl[l][r] = max(dpl[l][r-1], dpr[l+1][r] + 1);
    }
    rep(r, n){
      int l = r - k;
      if(l < 0)continue;
      if(l == r)dpr[l][r] = 1;
      else if(a[l] <= a[r])dpr[l][r] = dpr[l+1][r];
      else dpr[l][r] = max(dpr[l+1][r], dpl[l][r-1] + 1);
    }
  }
  /*rep(i, n){
    FOR(j, i, n){
      cout << i << " " << j << " " << dpl[i][j] << " " << dpr[i][j] << endl;
    }
    }*/
  int res = 0;
  rep(i, n)res = max(res, dpl[i][n-1]);
  rep(i, n)res = max(res, dpr[0][i]);
  cout << res << endl;
  return 0;
}
0