結果

問題 No.209 Longest Mountain Subsequence
ユーザー is_eri23
提出日時 2015-05-16 12:25:00
言語 C++11（廃止可能性あり）
(gcc 13.3.0)
結果
AC  
実行時間 337 ms / 2,000 ms
コード長 3,642 bytes
コンパイル時間 2,311 ms
コンパイル使用メモリ 172,236 KB
実行使用メモリ 13,096 KB
最終ジャッジ日時 2024-07-06 04:46:32
合計ジャッジ時間 2,911 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 6
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); 
    deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << 
    (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain 
    == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << 
    "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;
//unordered_mapで間に合う？
unordered_map <ll,int> myrank;
int N;
ll nums[110];
int ans[110][11000];
int ans2[110][11000];
int dp_go(int now, int r) {
  if (now == 0) {
    return 0;
  }
  if (ans[now][r] >= 0) {
    return ans[now][r];
  }
  
  int ret = 0;
  for (int i = now - 1; i >= 0; i--) {
    if (nums[i] < nums[now]) {
      auto nr = myrank[nums[now] - nums[i]];
      if (nr < r) {
        ret = max(ret, dp_go(i,nr) + 1);
      }
    }
  }
  return ans[now][r] = ret;
}
int dp_go2(int now, int r) {
  if (now == N) {
    return 0;
  }
  if (ans2[now][r] >= 0) {
    return ans2[now][r];
  }
  
  int ret = 0;
  for (int i = now + 1; i < N; i++) {
    if (nums[now] > nums[i]) {
      auto nr = myrank[nums[now] - nums[i]];
      if (nr < r) {
        ret = max(ret,dp_go2(i,nr) + 1);
      }
    }
  }
  return ans2[now][r] = ret;
}
int go[110];
int go2[110];
int solve(){
  vector <int> diff;
  rep(i,N){
    rep2(j,i+1,N){
      diff.pb(abs(nums[j] - nums[i]));
    }
  }
  sort(ALL(diff));
  diff.erase(unique(diff.begin(), diff.end()), diff.end());
  //DEBUG1(diff);
  myrank.clear();
  rep(i,sz(diff)){
    myrank[diff[i]] = i;
  }
  mem(ans,-1);
  mem(ans2,-1);
  int DIFF_MAX = sz(diff) + 10;
  rep(i,N){
    go[i] = dp_go(i,DIFF_MAX);
    //DEBUG2(i,go[i]);
  }
  rep(i,N){
    go2[i] = dp_go2(i,DIFF_MAX);
    //DEBUG2(i,go2[i]);
  }
  int ret = 0;
  rep(i,N){
    ret = max(ret, go[i] + go2[i] + 1);
  }
  return ret;
}
int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  int T;
  cin >> T;
  while(T--){
    cin >> N;
    rep(i,N){
      cin >> nums[i];
    }
    cout << solve() << endl;
  }
  return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0