STL离散化

[unique基操](https://www.cnblogs.com/wangkundentisy/p/9033782.html) [STL二分查找 lower_bound基操](https://www.cnblogs.com/bfshm/p/4085874.html) # code ```cpp int ys[N+5],s[N+5],tot,n; void lsh() { for(int i=1;i<=n;i++) ys[i]=s[i]; sort(ys+1,ys+n+1); tot=unique(ys+1,ys+n+1)-ys-1; for(int i=1;i<=n;i++) s[i]=lower_bound(ys+1,ys+tot+1,s[i])-ys; } ```