#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define crep(i,x,n) for(int i=x;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define vec(...) vector<__VA_ARGS__>
#define _31av4qi ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
using pii=pair<int,int>;
using vi=vector<int>;
int sgn(int x){
return x>=0?1:-1;
}
ll f(vec(ll) a){
int n=sz(a);
vec(vec(ll)) dp(n,vec(ll)(2));
dp[0][0]=dp[0][1]=0;
rep(i,n-1){
ll d=a[i+1]-a[i];
dp[i+1][0]=max(dp[i+1][0],dp[i][0]+d);
dp[i+1][0]=max({dp[i+1][0],dp[i][1],dp[i][0]});
dp[i+1][1]=max(dp[i+1][1],dp[i][1]-d);
dp[i+1][1]=max({dp[i+1][1],dp[i][0],dp[i][1]});
}
return max(dp[n-1][0],dp[n-1][1]);
}
int main(){
_31av4qi;
int n;
cin>>n;
// int q;
// cin>>q;
vec(ll) a(n);
rep(i,n){
cin>>a[i];
}
ll ans=f(a);
cout<<ans<<"\n";
//
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
332 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
332 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
332 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
