// need #include #include // data structure #include //#include #include #include #include #include #include #include #include //#include //#include #include #include #include //#include #include // stream //#include //#include //#include // etc #include #include #include //#include #include #include #include #define INIT std::ios::sync_with_stdio(false);std::cin.tie(0); #define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__); template void MACRO_VAR_Scan(T& t) { std::cin >> t; } templatevoid MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); } #define VEC_ROW(type, n, ...)std::vector __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); } templatevoid MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); } template void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; } templatevoid MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); } #define OUT(d) std::cout< c(n);for(auto& i:c)std::cin>>i; #define MAT(type, c, m, n) std::vector> c(m, std::vector(n));for(auto& r:c)for(auto& i:r)std::cin>>i; #define ALL(a) (a).begin(),(a).end() #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 REP(i, n) for(int i=0;i=0;--i) #define FORLL(i, a, b) for(ll i=ll(a);i=ll(a);--i) #define REPLL(i, n) for(ll i=0;i=0;--i) #define PAIR std::pair #define PAIRLL std::pair #define IN(a, x, b) (a<=x && x tmp(a);std::cerr << #a << "\t:";for(int i=0; i(a.size()); ++i){std::cerr << tmp.front() << "\n";tmp.pop();}std::cerr << "\n";} template inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; } template inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; } #define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]" #define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;} void CHECKTIME(std::function f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast((end - start)).count(); std::cerr << "[Time:" << res << "ns (" << res / (1.0e9) << "s)]\n"; } #define int ll using ll = long long; using ull = unsigned long long; constexpr int INFINT = 1 << 30; // 1.07x10^ 9 constexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9 constexpr ll INFLL = 1LL << 60; // 1.15x10^18 constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^18 constexpr double EPS = 1e-7; constexpr int MOD = 1000000007; constexpr double PI = 3.141592653589793238462643383279; //SegmentTree(セグ木) template class SegmentTree { private: T init_val; std::vector ary; std::function func; public: // 使用例(データの大きさNとする) // SegmentTree st(N, INF, [](T l, T r){return std::min(l, r);}); 最小値 // SegmentTree st(N, -INF, [](T l, T r){return std::max(l, r);}); 最大値 // SegmentTree st(N, 0, [](T l, T r){return l+r;}); 合計 SegmentTree(int n, T val, std::function f) : init_val(val), func(f) { ary.resize(static_cast(std::pow(2, std::ceil(std::log(n) / std::log(2)) + 1) - 1), val); } void init(int n, T val, std::function f) { ary.resize(static_cast(std::pow(2, std::ceil(1.0*std::log(n) / std::log(2)) + 1) - 1), val); init_val = val; func = f; } void update(int i, T val) { i += ary.size() / 2; ary[i] = val; while (i > 0) { i = (i - 1) / 2; ary[i] = func(ary[2 * i + 1], ary[2 * i + 2]); } } // 区間[a, b)のfuncの返す値を返す (query_(a, b, 0, 0, n)と呼び出す) T query_(int a, int b, int i, int l, int r) { if (r <= a || b <= l) return init_val; if (a <= l && r <= b) return ary[i]; else { T vl = query_(a, b, 2 * i + 1, l, (l + r) / 2); T vr = query_(a, b, 2 * i + 2, (l + r) / 2, r); return func(vl, vr); } } // 上限(b)は少し大きめに取るべし T query(int a, int b) { return query_(a, b, 0, 0, ary.size() / 2 + 1); } }; signed main() { INIT; VAR(int, n, d, k); VEC(int, x, n); SegmentTree st(n, -INFINT, [](int l, int r) {return std::max(l, r); }); REP(i, n) { st.update(i, x[i]); } int max = 0, max_i = -1; REP(i, n) { int t = st.query(i + 1, d + 1); if (max < t - x[i]) { max = t - x[i]; max_i = i; } } if (max_i == -1) { OUT(0)BR; return 0; } int ans = max * k; OUT(ans)BR; FOR(i, max_i, n) { if (x[i] - x[max_i] == max) { OUT(max_i)SP OUT(i)BR; return 0; } } return 0; }