#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define _USE_MATH_DEFINES #include #include using namespace std; inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; } template inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); } template inline T sqr(T x) { return x*x; } typedef vector vi; typedef vector vvi; typedef vector vll; typedef vector vs; typedef pair pii; typedef long long ll; typedef unsigned long long ull; //repetition //------------------------------------------ #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define rep(i,n) FOR(i,0,n) #define P(p) cout<<(p)< >(a, vector(b, 0)) #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(), (a).rend() #define pb push_back #define mp make_pair #define INF (1100000000) #define SZ(a) int((a).size()) #define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i) #define EXIST(s,e) ((s).find(e)!=(s).end()) #define SORT(c) sort((c).begin(),(c).end()) #define MOD 1000000007LL #define FSP(a) cout << fixed << setprecision(a) ll gcd(ll x, ll y) { if (y == 0) return x; else return gcd(y, x%y); } ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } bool is_prime(int n) { for (int i = 2; i * i <= n; i++) { if (n % i == 0) return false; } return n != 1; } map prime_factor(int n) { map res; for (int i = 2; i * i <= n; i++) { while (n % i == 0) { ++res[i]; n /= i; } } if (n != 1) res[n] = 1; return res; } int extgcd(int a, int b, int& x, int& y) {// int d = a; if (b != 0) { d = extgcd(b, a%b, y, x); y -= (a / b)*x; } else { x = 1; y = 0; } return d; } ll mod_pow(ll x, ll n, ll mod) { if (n == 0) return 1; ll res = mod_pow(x * x % mod, n / 2, mod); if (n & 1) res = res * x % mod; return res; } vector split(const string &str, char delim) { vector res; size_t current = 0, found; while ((found = str.find_first_of(delim, current)) != string::npos) { res.push_back(string(str, current, found - current)); current = found + 1; } res.push_back(string(str, current, str.size() - current)); return res; } bool is_kadomatsu(int a, int b, int c) { if (a == b || a == c || b == c)return false; if (a > b && c > b) return true; if (a < b && c < b)return true; return false; } struct UF { int n; vi d; UF() {} UF(int n) :n(n), d(n, -1) {} int root(int v) { if (d[v] < 0) return v; return d[v] = root(d[v]); } bool unite(int x, int y) { x = root(x); y = root(y); if (x == y) return false; if (size(x) < size(y)) swap(x, y); d[x] += d[y]; d[y] = x; return true; } int size(int v) { return -d[root(v)]; } }; vector divisor(int n) { if (n == 1) return{}; vi res; for (int i = 1; i*i <= n; i++) { if (n%i == 0) { res.emplace_back(i); if (i != 1 && i != n / i)res.emplace_back(n / i); } } return res; } struct Bellmanford { int n; struct edge { int from, to, cost; }; vector E; vi d; Bellmanford(int n) :n(n),d(n){ E.resize(n); } void add_edge(int x, int y,int cost) { edge e; e.from = x; e.to = y; e.cost = cost; E.push_back(e); } void shortest_path(int s) { rep(i, n)d[i] = INF; d[s] = 0; while (true) { bool update = false; for (auto e : E) { if (d[e.from] != INF && d[e.to] > d[e.from] + e.cost) { d[e.to] = d[e.from] + e.cost; update = true; } } if (!update) break; } } }; struct Dijkstra { int n; struct edge { int to, cost; }; vector> G; vi d; Dijkstra(int n) :n(n),d(n) { G.resize(n); } void add_edge(int x, int y, int cost) { edge e; e.to = y; e.cost = cost; G[x].push_back(e); } void shortest_path(int s) { rep(i, n)d[i] = INF; d[s] = 0; priority_queue, greater> que; que.push(make_pair(0, s)); while (!que.empty()) { pii p = que.top(); que.pop(); int v = p.second; if (d[v] < p.first) continue; for (auto e : G[v]) { if (d[e.to] > d[v] + e.cost) { d[e.to] = d[v] + e.cost; que.push(make_pair(d[e.to], e.to)); } } } } }; struct Segmenttree { int n; vll dat; Segmenttree(){} void init(int n_) { n = 1; while (n < n_) n *= 2; dat.resize(2*n-1); rep(i, 2 * n - 1)dat[i] = -INF; } void update(int k, int a) { //index-k を a に変更 k +=n - 1; dat[k] = a; while (k > 0) { k = (k - 1) / 2; dat[k] = max(dat[k * 2 + 1], dat[k * 2 + 2]); } } int query(int a, int b) { return query_seg(a, b, 0, 0, n); } int query_seg(int a, int b, int k, int l, int r) { if (r <= a || b <= l) return -INF; if (a <= l && r <= b)return dat[k]; else { return max(query_seg(a, b, k * 2 + 1, l, (l + r) / 2), query_seg(a, b, k * 2 + 2, (l + r) / 2, r)); } } }; //------------------------------------------------------------- int main() { ll n, d, k; cin >> n >> d >> k; vi a(n); rep(i, n) cin >> a[i]; ll ansb = -1, anss = -1, maxdiff = 0; Segmenttree sg; sg.init(n); rep(i, n) { sg.update(i, a[i]); } rep(i, n - d) { ll tmpdiff = sg.query(i, i + d+1) - a[i]; if (tmpdiff > maxdiff) { ansb = i; maxdiff = tmpdiff; for (int j = i; j <= i + d; j++) { if (a[j] - a[i] == maxdiff) { anss = j; break; } } } } P(maxdiff*k); if (maxdiff == 0) return 0; cout << ansb << " " << anss << endl; return 0; }