nyoj 79 攔截飛彈 (動態規劃)

標籤：

題目連結：http://acm.nyist.net/JudgeOnline/problem.php?pid=79

題意即求最長單調遞減子序列

#include<iostream>#include<cstdio>#include<cstring>using namespace std;#define N 22int h[N];int d[N];int main(){    freopen("d:\\in.txt", "r", stdin);    int t, n;    cin>>t;    while(t--){        cin>>n;        for(int i=0; i<n; i++)            cin>>h[i];        int ans = 0;        for(int i=n-1; i>=0; i--){            d[i] = 1;            for(int j=i+1; j<n; j++){                if(h[j] < h[i])                    d[i] = max(d[i], d[j]+1);            }            ans = max(ans, d[i]);        }        cout<<ans<<endl;    }}

nyoj 79 攔截飛彈 (動態規劃)