poj 3250 单调栈

题目描述即链接:
大意求在这个数之后的比这个数小的数的个数
https://vjudge.net/problem/POJ-3250

---

分析:
将每个数看到的个数转化为每个数被看到的个数

---

Code:

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<stack>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
const int N=8e5+10;
struct num{
    int val,id;
    num(int val=0,int id=0):val(val),id(id){}
}a;
stack<num>s;
int n;long long ans=0;
int read(){
    char p=' ';int x=0;
    while(!(p>='0'&&p<='9')) p=getchar();
    while(p>='0'&&p<='9') x=x*10+p-'0',p=getchar();
    return x;
}
int main(){
    scanf("%d",&n);
    int vi;
    fo(i,1,n)
    {
        scanf("%d",&vi);
        while(!s.empty()&&s.top().val<=vi) s.pop();
        ans+=s.size();
        s.push(num(vi,i));
    }
    printf("%lld",ans);
    return 0;
}