题解:
考虑差分(a[i]-a[i-1],i≥2)后的序列b,每一次操作可以使b[i]加1/减1/正负相消。所以最少次数即max(∑正b[i],∑-负b[i]),最终序列种数为abs(∑正b[i]-∑-负b[i])+1,本蒟蒻无法严格证明,但是可以模拟一组数据来验证。
5
4 1 7 6 2
答案为max(8,6)=8和abs(8-6)+1=3
三种目标序列为{2,2,2,2,2},{3,3,3,3,3},{4,4,4,4,4}
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[100004],pos=0,neg=0;
int n;
int main() {
scanf("%d",&n);
for (register int i=1;i<=n;++i) scanf("%lld",&a[i]);
for (register int i=2;i<=n;++i) a[i]>a[i-1]?pos+=a[i]-a[i-1]:neg+=a[i-1]-a[i];
cout<<max(pos,neg)<<endl<<abs(pos-neg)+1<<endl;
return 0;
}