CodeForces - 987 C.Three displays

这是思维题吗，用的动归的的

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<math.h>
using namespace std;
#define INF 1e9+5
struct node
{
    int s,c;
}q[3005];
int dpo[3005],dpt[3005];
int main()
{
    int n,sum=INF;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&q[i].s);
    }
    for(int i=1;i<=n;i++){
        scanf("%d",&q[i].c);
    }
    for(int i=1;i<=n;i++){
        dpo[i]=dpt[i]=INF;
    }
    for(int i=1;i<=n-1;i++){
        for(int j=i+1;j<=n;j++){
            if(q[j].s>q[i].s){
                dpo[j]=min(dpo[j],q[i].c+q[j].c);
            }
        }
    }
    /*for(int i=1;i<=n;i++){
        cout<<dpo[i]<<"  ";
    }
    cout<<endl;*/
    for(int i=2;i<=n-1;i++){
        for(int j=i+1;j<=n;j++){
            if(q[j].s>q[i].s){
                dpt[j]=min(dpt[j],dpo[i]+q[j].c);
                sum=min(dpt[j],sum);
                //cout<<sum<<endl;
            }
        }
    }
    /*for(int i=1;i<=n;i++){
        cout<<dpt[i]<<"  ";
    }*/
    if(sum==INF){
        printf("-1\n");
    }
    else{
    printf("%d\n",sum);}
}