結果
問題 | No.127 門松もどき |
ユーザー | is_eri23 |
提出日時 | 2015-02-09 23:17:30 |
言語 | C++11 (gcc 13.3.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,784 bytes |
コンパイル時間 | 1,614 ms |
コンパイル使用メモリ | 157,560 KB |
実行使用メモリ | 75,392 KB |
最終ジャッジ日時 | 2024-06-23 16:51:12 |
合計ジャッジ時間 | 5,102 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 21 ms
75,136 KB |
testcase_01 | AC | 21 ms
74,948 KB |
testcase_02 | AC | 20 ms
74,940 KB |
testcase_03 | AC | 21 ms
75,100 KB |
testcase_04 | WA | - |
testcase_05 | AC | 20 ms
75,084 KB |
testcase_06 | AC | 34 ms
75,008 KB |
testcase_07 | WA | - |
testcase_08 | AC | 22 ms
75,060 KB |
testcase_09 | AC | 21 ms
75,060 KB |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | AC | 112 ms
75,264 KB |
testcase_17 | AC | 122 ms
75,136 KB |
testcase_18 | AC | 104 ms
75,264 KB |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | AC | 220 ms
75,264 KB |
testcase_23 | AC | 186 ms
75,136 KB |
testcase_24 | AC | 159 ms
75,264 KB |
testcase_25 | AC | 193 ms
75,264 KB |
testcase_26 | WA | - |
ソースコード
#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;int N;int nums[3030];int memo[3030][3030][2];int dp_go(int x, int y, bool high){if (x == y) {return 1;}if (memo[x][y][high] >= 0) {return memo[x][y][high];}int ret = 0;if (high) {// x < yif (nums[x] < nums[y]) {ret = 1 + dp_go(x+1,y,false);}ret = max(ret, dp_go(x,y-1,high));}else { //x > yif (nums[x] > nums[y]) {ret = 1 + dp_go(x,y-1,true);}ret = max(ret, dp_go(x+1,y,high));}//DEBUG3(x,y,ret)return memo[x][y][high] = ret;}int main(){cin.tie(0);ios_base::sync_with_stdio(0);cin >> N;rep(i,N){cin >> nums[i];}mem(memo,-1);int ans = 0;rep(i,N) {rep2(j,i,N){//DEBUG2(i,j);ans = max(ans, dp_go(i,j,true));}}cout << ans << endl;return 0;}