結果
問題 | No.930 数列圧縮 |
ユーザー |
![]() |
提出日時 | 2020-02-05 22:18:00 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 42 ms / 2,000 ms |
コード長 | 5,157 bytes |
コンパイル時間 | 1,830 ms |
コンパイル使用メモリ | 171,992 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-09-23 04:11:28 |
合計ジャッジ時間 | 4,967 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 24 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define int long long// #define double long double#define FOR(i, a, b) for(int i = (a); i < (b); ++i)#define FORR(i, a, b) for(int i = (a); i > (b); --i)#define REP(i, n) for(int i = 0; i < (n); ++i)#define REPR(i, n) for(int i = n; i >= 0; i--)#define FOREACH(x, a) for(auto &(x) : (a))#define VECCIN(x) \for(auto &youso_ : (x)) cin >> youso_#define bitcnt(x) __builtin_popcount(x)#define lbit(x) __builtin_ffsll(x)#define rbit(x) (64 - __builtin_clzll(x))#define fi first#define se second#define All(a) (a).begin(), (a).end()#define rAll(a) (a).rbegin(), (a).rend()#define cinfast() cin.tie(0), ios::sync_with_stdio(false)#define PERM(c) \sort(All(c)); \for(bool cp = true; cp; cp = next_permutation(All(c)))#define COMB(n, k) \for(ll bit = (1LL << k) - 1; bit < (1LL << n); bit = next_combination(bit))#define PERM2(n, k) \COMB(n, k) { \vector<int> sel; \for(int bitindex = 0; bitindex < n; bitindex++) \if(bit >> bitindex & 1) sel.emplace_back(bitindex); \PERM(sel) { Printv(sel); } \}#define MKORDER(n) \vector<int> od(n); \iota(All(od), 0LL);template <typename T = long long> inline T IN() {T x;cin >> x;return (x);}inline void CIN() {}template <class Head, class... Tail>inline void CIN(Head &&head, Tail &&... tail) {cin >> head;CIN(move(tail)...);}template <class Head> inline void COUT(Head &&head) { cout << (head) << "\n"; }template <class Head, class... Tail>inline void COUT(Head &&head, Tail &&... tail) {cout << (head) << " ";COUT(forward<Tail>(tail)...);}#define CCIN(...) \char __VA_ARGS__; \CIN(__VA_ARGS__)#define DCIN(...) \double __VA_ARGS__; \CIN(__VA_ARGS__)#define LCIN(...) \long long __VA_ARGS__; \CIN(__VA_ARGS__)#define SCIN(...) \string __VA_ARGS__; \CIN(__VA_ARGS__)#define Printv(v) \{ \FOREACH(x, v) { cout << x << " "; } \cout << "\n"; \}template <typename T = string> inline void eputs(T s) {cout << s << "\n";exit(0);}template <typename A, size_t N, typename T>void Fill(A (&array)[N], const T &val) {std::fill((T *)array, (T *)(array + N), val);}long long next_combination(long long sub) {long long x = sub & -sub, y = sub + x;return (((sub & ~y) / x) >> 1) | y;}// generic lambdastemplate <typename F>#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)[[nodiscard]]#elif defined(__GNUC__) && (__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)__attribute__((warn_unused_result))#endif // defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)static inline constexpr decltype(auto)fix(F &&f) noexcept {return [f = std::forward<F>(f)](auto &&... args) {return f(f, std::forward<decltype(args)>(args)...);};}template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;template <typename T> using PQ = priority_queue<T>;typedef long long ll;typedef vector<ll> VL;typedef vector<VL> VVL;typedef pair<ll, ll> PL;typedef vector<PL> VPL;typedef vector<bool> VB;typedef vector<double> VD;typedef vector<string> VS;const int INF = 1e9;const int MOD = 1e9 + 7;// const int MOD = 998244353;const ll LINF = 1e18;const ll dw[] = {1, 1, 0, -1, -1, -1, 0, 1};const ll dh[] = {0, 1, 1, 1, 0, -1, -1, -1};#define PI 3.141592653589793230#define EPS 1e-7ll dp[5005][5005][2];void chmax(ll &a, ll b) { a = max(a, b); }signed main() {LCIN(N);VL A(N);VECCIN(A);if(A[0] > A[N - 1]) eputs("No");VL ans;REP(i, N - 1) if(A[i] > A[0]) ans.emplace_back(A[i]);REPR(i, N - 2) if(A[i] < A[0]) ans.emplace_back(A[i]);ans.emplace_back(A[N - 1]);cout << "Yes"<< "\n";Printv(ans);}