func_code_string: #include <bits/stdc++.h>   using namespace std;   typedef signed long long ll;      #define _P(...) (void)printf(__VA_ARGS__)   #define FOR(x,to) for(x=0;x<(to);x++)   #define FORR(x,arr) for(auto& x:arr)   #define FORR2(x,y,arr) for(auto& [x,y]:arr)   #define ALL(a) (a.begin()),(a.end())   #define ZERO(a) memset(a,0,sizeof(a))   #define MINUS(a) memset(a,0xff,sizeof(a))   template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}   template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}   //-------------------------------------------------------      int T,N,A[5050],S[5050];      ll dp[5050];      void solve() {    int i,j,k,l,r,x,y; string s;        cin>>T;    while(T--) {     cin>>N;     FOR(i,N) cin>>A[i];     FOR(i,N) cin>>S[i];     FOR(i,N+1) dp[i]=-1LL<<60;          ll ret=0;     FOR(i,N) {      ll ma=0;      for(j=i-1;j>=0;j--) if(A[i]!=A[j]) {       ll nma=ma+abs(S[i]-S[j]);       ma=max(ma,dp[j]+abs(S[i]-S[j]));       dp[j]=max(dp[j],nma);      }      dp[i]=ma;     }     FOR(i,N) ret=max(ret,dp[i]);     cout<<ret<<endl;    }   }         int main(int argc,char** argv){    string s;int i;    if(argc==1) ios::sync_with_stdio(false), cin.tie(0);    FOR(i,argc-1) s+=argv[i+1],s+=  n ; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);    cout.tie(0); solve(); return 0;   }   