不难发现倾角最大的肯定是相邻两点。
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 100005;
LL a[N];
int main() {
int n; scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
LL tmp = 0;
int ans = 0;
for (int i = 2; i <= n; i++) {
if (abs(a[i] - a[i - 1]) > tmp) {
tmp = abs(a[i] - a[i - 1]);
ans = i;
}
}
printf("%d %d\n", ans - 1, ans);
return 0;
}