結果
問題 | No.1095 Smallest Kadomatsu Subsequence |
ユーザー |
![]() |
提出日時 | 2023-06-28 11:41:46 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 275 ms / 2,000 ms |
コード長 | 3,494 bytes |
コンパイル時間 | 1,267 ms |
コンパイル使用メモリ | 131,304 KB |
最終ジャッジ日時 | 2025-02-15 02:49:25 |
ジャッジサーバーID (参考情報) |
judge1 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 30 |
ソースコード
#include<iostream>#include<string>#include<vector>#include<algorithm>#include<numeric>#include<cmath>#include<utility>#include<tuple>#include<cstdint>#include<cstdio>#include<iomanip>#include<map>#include<queue>#include<set>#include<stack>#include<deque>#include<unordered_map>#include<unordered_set>#include<bitset>#include<cctype>#include<chrono>#include<random>#include<cassert>#include<cstddef>#include<iterator>#include<string_view>#include<type_traits>#ifdef LOCAL# include "debug_print.hpp"# define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)#else# define debug(...) (static_cast<void>(0))#endifusing namespace std;#define rep(i,n) for(int i=0; i<(n); i++)#define rrep(i,n) for(int i=(n)-1; i>=0; i--)#define FOR(i,a,b) for(int i=(a); i<(b); i++)#define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--)#define ALL(v) v.begin(), v.end()#define RALL(v) v.rbegin(), v.rend()#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );#define pb push_backusing ll = long long;using D = double;using LD = long double;using P = pair<int, int>;template<typename T> using PQ = priority_queue<T,vector<T>>;template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;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; }void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}template<typename T, typename U>ostream &operator<<(ostream &os, const pair<T, U> &p) {os << p.first << " " << p.second;return os;}template<typename T, typename U>istream &operator>>(istream &is, pair<T, U> &p) {is >> p.first >> p.second;return is;}template<typename T>ostream &operator<<(ostream &os, const vector<T> &v) {int s = (int)v.size();for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];return os;}template<typename T>istream &operator>>(istream &is, vector<T> &v) {for (auto &x : v) is >> x;return is;}void in() {}template<typename T, class... U>void in(T &t, U &...u) {cin >> t;in(u...);}void out() { cout << "\n"; }template<typename T, class... U, char sep = ' '>void out(const T &t, const U &...u) {cout << t;if (sizeof...(u)) cout << sep;out(u...);}void outr() {}template<typename T, class... U, char sep = ' '>void outr(const T &t, const U &...u) {cout << t;outr(u...);}int main(){ios_base::sync_with_stdio(false);cin.tie(nullptr);const ll INF = 1e18;int n; in(n);vector<ll> a(n); in(a);vector<ll> minl(n+1, INF), minr(n+1, INF);rep(i,n){minl[i+1] = min(minl[i], a[i]);minr[i+1] = min(minr[i], a[n-i-1]);}ll ans = INF;rep(i,n){ll min1 = minl[i], min2 = minr[n-i-1];if(min1 >= a[i] or min2 >= a[i]) continue;chmin(ans, min1 + min2 + a[i]);}vector<ll> minl2(n+1, INF), minr2(n+1, INF);set<ll> s;rep(i,n-1){s.insert(a[i]);auto it = s.upper_bound(a[i+1]);if(it != s.end()) minl2[i+1] = *it;}s.clear();rep(i,n-1){s.insert(a[n-i-1]);auto it = s.upper_bound(a[n-i-2]);if(it != s.end()) minr2[i+1] = *it;}rep(i,n){ll min1 = minl2[i], min2 = minr2[n-i-1];if(min1 <= a[i] or min2 <= a[i]) continue;chmin(ans, min1 + min2 + a[i]);}out(ans == INF ? -1 : ans);}