結果
問題 | No.489 株に挑戦 |
ユーザー |
|
提出日時 | 2017-02-27 21:57:03 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 37 ms / 1,000 ms |
コード長 | 3,519 bytes |
コンパイル時間 | 824 ms |
コンパイル使用メモリ | 87,876 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-19 23:36:08 |
合計ジャッジ時間 | 2,542 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 35 |
ソースコード
#include<iostream>#include<fstream>#include<sstream>#include<algorithm>#include<vector>#include<queue>#include<map>#include<set>#include<string>#include<cmath>#include<cstdio>#include<cassert>using namespace std;#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)#define RREP(i,m,n) for(int i=(int)(n-1); i>=m; i--)#define rep(i,n) REP(i,0,n)#define rrep(i,n) RREP(i,0,n)#define all(a) (a).begin(),(a).end()#define rall(a) (a).rbegin(),(a).rend()#define aut(r,v) __typeof(v) r = (v)#define each(it,o) for(aut(it,(o).begin()); it!=(o).end(); ++it)#define reach(it,o) for(aut(it,(o).rbegin()); it!=(o).rend(); ++it)#define fi first#define se second#define dump(x) cerr << " [L" << __LINE__ << "] " << #x << " = " << (x) << endl;inline void debug(){cerr<<endl;}template<class First, class... Rest>void debug(const First& first, const Rest&... rest){cerr<<first<<" ";debug(rest...);}template<typename T>string join(vector<T>&v, string del=", "){stringstream s;rep(i,v.size())s<<del<<v[i];return s.str().substr(del.size());}template<typename T1, typename T2> ostream& operator<<(ostream& o, const pair<T1, T2>& p){return o<<"("<<p.first<<", "<<p.second<<")";}template<typename T>ostream& operator<<(ostream& o, vector<T>&v){if(v.size())o<<"["<<join(v)<<"]";return o;}template<typename T>ostream& operator<<(ostream& o, vector<vector<T> >&vv){int l=vv.size();if(l){rep(i,l){o<<(i==0?"[ ":",\n ")<<vv[i]<<(i==l-1?" ]":"");}}return o;}template<typename T>ostream& operator<<(ostream& o, const set<T>& st){vector<T> v(st.begin(),st.end());o<<"{ "<<join(v)<<" }";return o;}template<typename T1, typename T2>ostream& operator<<(ostream& o, const map<T1, T2>& m){each(p,m){o<<(p==m.begin()?"{ ":",\n ")<<*p<<(p==--m.end()?" }":"");}return o;}using ll = long long;using pii = pair<int, int>;using vi = vector<int>;using vvi = vector<vi>;using vl = vector<ll>;using vvl = vector<vl>;const double PI = (1*acos(0.0));const double INF = 0x3f3f3f3f;const double INFL = 0x3f3f3f3f3f3f3f3fLL;const double EPS = 1e-9;const double mod = 1e9 + 7;inline void finput(string filename) {freopen(filename.c_str(), "r", stdin);}struct RMQ{int n;vector<int> dat;void init(int n_){n = 1;while(n < n_) n <<= 1;dat = vector<int>(2*n-1, -1);}void update(int k, int a){int reaf = k+n-1;dat[reaf] = a;while(reaf > 0){reaf = (reaf-1) / 2;dat[reaf] = max(dat[reaf*2+1], dat[reaf*2+2]);}}int search(int a, int b, int k, int l, int r){if(b <= l || r <= a) return -1;if(a <= l && r <= b) return dat[k];else{int rl = search(a, b, 2*k+1, l, (l+r)/2);int rr = search(a, b, 2*k+2, (l+r)/2, r);return max(rl, rr);}}int query(int a, int b){return search(a, b+1, 0, 0, n);}};vi x;int main(){ios_base::sync_with_stdio(0);// finput("./input");ll N, D, K;cin >> N >> D >> K;RMQ rmq;rmq.init(N);rep(i, N){int _x;cin >> _x;x.push_back(_x);rmq.update(i, _x);}ll ma = -1;int j = -1, k = -1;rep(i,N){int m = rmq.query(i, min(i+D, N));if(ma < m - x[i]){ma = m - x[i];j = i;}}REP(i,j,min(j+D+1,N)) if(x[i] - x[j] == ma){ k = i; break; }cout << ma*K << endl;if(ma != 0) cout << j << " " << k << endl;return 0;}