拦截导弹

http://acm.nyist.net/JudgeOnline/problem.php?pid=79 

不明白哪儿有问题，有待验证

#include <stdio.h>

int floor = 0;
void recurring(int missile[],int begin,int size,int& cur){
    ++cur;
    if(begin >= size - 1)
        return ;
    int i;
    for(i = begin; i < size; i++){
        if(missile[i] < missile[begin]){
            recurring(missile,i,size,cur);
            floor = (floor > cur) ? floor : cur;
            --cur;
        }
    }
}

int main(){
    int N;
    int m;
    int missile[50];
    int i,cur;
    scanf("%d",&N);
    while(N--){
        scanf("%d",&m);
        cur = 0;
        for(i = 0; i < m; i++)
            scanf("%d",&missile[i]);
        recurring(missile,0,m,cur);
        printf("%d
",floor);
        floor = 0;
    }
    return 0;
}

 不明觉厉，为啥还不对

#include <stdio.h>
#include <iostream>
#include <algorithm>
using namespace std;
#define M 50
int res[M];
void dp(int missile[],int cur,int Size){
    if(cur < 0) return ;
    for(int i = Size - 1; i > cur; i--){
        if(missile[cur] > missile[i]){
            res[cur] = (res[cur] > res[i]) ? res[cur] : res[i] + 1;
        }
    }
    dp(missile,cur - 1,Size);
}

int main(){
    int N;
    int m;
    int missile[50];
    int i;
    scanf("%d",&N);
    while(N--){
        fill(res,res+50,1);
        scanf("%d",&m);
        for(i = 0; i < m; i++)
            scanf("%d",&missile[i]);
        dp(missile,m - 2,m);
        printf("%d
",res[0]);
    }
    return 0;
}

 又失败了|-_-|

#include <stdio.h>
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
    int N;
    int m;
    int missile[50],res[50];
    int i;
    scanf("%d",&N);
    while(N--){
        fill(res,res+50,1);
        scanf("%d",&m);
        for(i = 0; i < m; i++)
            scanf("%d",&missile[i]);
        for(int j = m-2; j >= 0; j--){
            for(int i = m - 1; i > j; i--){
                if(missile[j] > missile[i]){
                    res[j] = (res[j] > res[i]) ? res[j] : res[i] + 1;
                }
            }
        }
        printf("%d
",res[0]);
    }
    return 0;
}