SDUT 2075 最少拦截系统

最少拦截系统 

点击打开链接

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int pp[310];
int main()
{
    int n, num;
    while(cin >> n)
    {
        num = 0;
        for(int i = 0; i < n; i++)
            cin >> pp[i];
        for(int i = 0; i < n; i++)
        {
            if(pp[i] != 0)
            {
                int h = pp[i];
                for(int j = i+1; j < n; j++)
                {
                    if(pp[j] <= h && pp[j] != 0)
                    {
                        h = pp[j];
                        pp[j] = 0;
                    }
                }
                 num++;
            }
        }
        cout << num << endl;
    }
    return 0;
}