結果
問題 | No.489 株に挑戦 |
ユーザー |
|
提出日時 | 2019-11-22 12:15:26 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 1,797 bytes |
コンパイル時間 | 841 ms |
コンパイル使用メモリ | 89,104 KB |
最終ジャッジ日時 | 2024-11-14 21:51:20 |
合計ジャッジ時間 | 2,018 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp:16:39: error: '::numeric_limits' has not been declared 16 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; | ^~~~~~~~~~~~~~ main.cpp:16:55: error: expected primary-expression before '>' token 16 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; | ^ main.cpp:16:61: error: no matching function for call to 'max()' 16 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; | ~~~~~^~ In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/string:50, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/locale_classes.h:40, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/ios_base.h:41, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ios:42, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:38, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/iostream:39, from main.cpp:1: /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:254:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)' 254 | max(const _Tp& __a, const _Tp& __b) | ^~~ /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:254:5: note: template argument deduction/substitution failed: main.cpp:16:61: note: candidate expects 2 arguments, 0 provided 16 | template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; | ~~~~~^~ /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:300:5: note: candidate: 'templat
ソースコード
#include <iostream>#include <algorithm>#include <iomanip>#include <map>#include <set>#include <queue>#include <stack>#include <numeric>#include <bitset>#include <cmath>static const int MOD = 1000000007;using ll = long long;using namespace std;template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;template<class T, class F>class sliding_window {vector<T> v;deque<int> Q;F f;public:int l, r;explicit sliding_window(vector<T> &v, F f) : v(v), f(f), l(0), r(0) {};void set(vector<T> &u){v = u;Q.clear();l = 0; r = 0;}void reset(){Q.clear();l = 0, r = 0;}void slideL(){if(Q.front() == l++) Q.pop_front();}void slideR(){while(!Q.empty() && !f(v[Q.back()], v[r])) Q.pop_back();Q.push_back(r++);}int get_index() {if(l == r) return 0;return Q.front();}T value() {if(l == r) return T{};return v[Q.front()];}};int main() {ll n, d, k;cin >> n >> d >> k;vector<pair<int, int>> v(n);for (int i = 0; i < n; ++i) {scanf("%d", &v[i].first);v[i].second = i;}auto f = [&](pair<int, int> x, pair<int, int> y){return x < y;};sliding_window<pair<int, int>, decltype(f)> a(v, f);ll cur1 = 0, cur2 = 0, ans = 0;for (int i = 1; i < n; ++i) {a.slideR();if(i > d) a.slideL();ll val = k*(v[i].first-a.value().first);if(ans < val){ans = val;cur1 = a.get_index();cur2 = i;}}if(ans){cout << ans << "\n";cout << cur1 << " " << cur2 << "\n";}else {cout << ans << "\n";}return 0;}