Submission
Status:
[PP-SSSSSSSSSS]
Subtask/Task Score:
{0/100}
Score: 0
User: nik121416
Problemset: ซื้อขายหุ้นซีเค
Language: cpp
Time: 0.009 second
Submitted On: 2026-03-13 13:30:32
#include <bits/stdc++.h>
using namespace std;
int n;
int f(int a,int b,vector<vector<int>> &mem,vector<int> &num){
if(a > n-1 || b > n-1) return 0;
if(mem[a][b] != -1) return mem[a][b];
return mem[a][b] = max(f(a + 1,b,mem,num),max(f(a+1,b+1,mem,num),abs(num[a]-num[b])));
}
int main(){
cin >> n;
vector<vector<int>> mem(n,vector<int> (n,-1));
vector<int> num(n);
for(int i= 0 ; i < n;i++){
cin >> num[i];
}
cout << f(0,0,mem,num);
}