AcWing 1904. 奶牛慢跑

#include 
#include 
#include 

using namespace std;

const int N = 100010,INF=2e9;
int v[N];
int main()
{
    int n;
    scanf("%d", &n);
    for(int i=0;i=0;i--){
        if(v[i]<=minv){
            res++;
            minv=v[i];
        }
    }
    printf("%d",res);
    return 0;
}