結果
問題 | No.209 Longest Mountain Subsequence |
ユーザー |
![]() |
提出日時 | 2015-05-15 22:54:16 |
言語 | C++11 (gcc 13.3.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,098 bytes |
コンパイル時間 | 1,571 ms |
コンパイル使用メモリ | 164,452 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-06 04:12:36 |
合計ジャッジ時間 | 2,091 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | WA * 6 |
ソースコード
#include <bits/stdc++.h>using namespace std;typedef pair<int,int> PII;typedef long long LL;typedef unsigned long long ULL;template<class T> inline bool amax (T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool amin (T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; }template<class T> ostream& operator << (ostream &os, const vector<T> &v) { os << "["; for (typename vector<T>::const_iterator it = v.begin(); it != v.end(); it++) { os << (it != v.begin() ? ", " : "") << *it; } os << "]"; return os; }template<class T> ostream& operator << (ostream &os, const set<T> &s) { os << "["; for (typename set<T>::const_iterator it = s.begin(); it != s.end();it++) { os << (it != s.begin() ? ", " : "") << *it; } os << "]"; return os; }template<class Key, class Val> ostream& operator << (ostream &os, const map<Key, Val> &m) { os << "{"; for (typename map<Key, Val>::const_iterator it= m.begin(); it != m.end(); it++) { os << (it != m.begin() ? ", " : "") << it->first << ":" << it->second; } os << "}"; return os; }template<class T, class S> ostream& operator << (ostream &os, const pair<T, S> &p) { os << "(" << p.first << ", " << p.second << ")"; return os; }template <class Target, class Source> inline Target lexical_cast (const Source &s) { Target t; stringstream ss; ss << s; ss >> t; return t; }//> v < ^ (clock wise)int dx[] = {1,0,-1,0};int dy[] = {0,1,0,-1};const int INFI = 1<<28;const long long int INFL = 1LL<<60;const double INFD = 1e+300;const float INFF = 1e+100;const double EPS = 1e-8;int main(){cout.setf(ios::fixed); cout.precision(10);ios_base::sync_with_stdio(false);int T;cin >> T;while (T--) {int n;cin >> n;vector<int> a(n);for (int i = 0; i < n; i++) cin >> a[i];vector<vector<int> > dp1(110, vector<int>(110, INFI));dp1[0][0] = 0;for (int i = 0; i < n; i++) {for (int j = 0; j < n; j++) {for (int k = 0; k < n; k++) {if (dp1[j][k] != INFI && dp1[j][k] < a[i]-a[j]) dp1[i][k+1] = min(dp1[i][k+1], a[i]-a[j]);}}}reverse(a.begin(), a.end());vector<vector<int> > dp2(110, vector<int>(110, INFI));dp2[0][0] = 0;for (int i = 0; i < n; i++) {for (int j = 0; j < i; j++) {for (int k = 0; k < n; k++) {if (dp2[j][k] != INFI && dp2[j][k] < a[i]-a[j]) dp2[i][k+1] = min(dp2[i][k+1], a[i]-a[j]);}}}int ans = 0;for (int i = 0; i < n; i++) {int tmp = 0;for (int j = n-1; j >= 0; j--)if (dp1[i][j] != INFI) {tmp += j;break;}for (int j = n-1; j >= 0; j--)if (dp2[n-i-1][j] != INFI) {tmp += j;break;}ans = max(ans, tmp);}cout << ans+1 << endl;}return 0;}