本题链接:201609-1 最大波动
本博客给出本题截图:
C++
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1010;
int n;
int q[N];
int main()
{
cin >> n;
for (int i = 0; i < n; i ++ ) cin >> q[i];
int res = 0;
for (int i = 1; i < n; i ++ )
res = max(res, abs(q[i] - q[i - 1]));
cout << res << endl;
return 0;
}
总结
水题,不解释