結果
問題 | No.1095 Smallest Kadomatsu Subsequence |
ユーザー |
![]() |
提出日時 | 2020-09-10 21:22:43 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 233 ms / 2,000 ms |
コード長 | 2,593 bytes |
コンパイル時間 | 1,906 ms |
コンパイル使用メモリ | 201,664 KB |
最終ジャッジ日時 | 2025-01-14 09:18:16 |
ジャッジサーバーID (参考情報) |
judge1 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 30 |
ソースコード
//#include <tourist>#include <bits/stdc++.h>//#include <atcoder/all>using namespace std;//using namespace atcoder;typedef long long ll;typedef unsigned int uint;typedef unsigned long long ull;typedef pair<ll, ll> p;const int INF = 1e9;const ll LINF = ll(1e18);const int MOD = 1000000007;const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};#define yes cout << "Yes" << endl#define YES cout << "YES" << endl#define no cout << "No" << endl#define NO cout << "NO" << endl#define rep(i, n) for (int i = 0; i < n; i++)#define FOR(i, m, n) for (int i = m; i < n; i++)#define ALL(v) v.begin(), v.end()#define debug(v) \cout << #v << ":"; \for (auto x : v) \{ \cout << x << ' '; \} \cout << endl;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 (b < a){a = b;return 1;}return 0;}//cout<<fixed<<setprecision(15);有効数字15桁//-std=c++14//g++ yarudake.cpp -std=c++17 -I .ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }int main(){cin.tie(0);ios::sync_with_stdio(false);ll n, m;cin >> n;vector<ll> a(n);rep(i, n) cin >> a[i];vector<ll> b(n, 0), c(n, 0);vector<ll> bb(n, INF), cc(n, INF);set<ll> s1, s2;rep(i, n){auto iter = s1.lower_bound(a[i]);if (iter != s1.end()){b[i] = *iter;}else{b[i] = INF;}if (s1.begin() != s1.end()){if (*s1.begin() < a[i]){bb[i] = *s1.begin();}}s1.insert(a[i]);}for (int i = n - 1; i >= 0; i--){auto iter = s2.lower_bound(a[i]);if (iter != s2.end()){c[i] = *iter;}else{c[i] = INF;}if (s2.begin() != s2.end()){if (*s2.begin() < a[i]){cc[i] = *s2.begin();}}s2.insert(a[i]);}ll ans = INF;rep(i, n){chmin(ans, a[i] + b[i] + c[i]);chmin(ans, a[i] + bb[i] + cc[i]);}if (ans == INF){cout << -1 << "\n";}else{cout << ans << "\n";}}