3 solutions
-
3
#include<bits/stdc++.h> using namespace std; const int N=1100110; int f[N][2]; int a[N]; int main() { int n; cin>>n; for(int i=1;i<=n;i++) { cin>>a[i]; } memset(f,0xcf,sizeof f); f[0][0]=0; for(int i=1;i<=n;i++) { f[i][0]=max(f[i-1][0],f[i-1][1]+a[i]); f[i][1]=max(f[i-1][1],f[i-1][0]-a[i]); } cout<<f[n][0]; return 0; }
Information
- ID
- 217
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 5
- Tags
- # Submissions
- 49
- Accepted
- 21
- Uploaded By