传送门

两个multiset

一个记录相邻元素的差，一个放所有的元素

2个数组

val[i]记录第i个的值，last[i]记录第i个最后插入的数的值

然后乱搞

#include <set>#include <cstdio>#include <iostream>#define N 1001000#define abs(x) ((x) < 0 ? (x) : (x))#define min(x, y) ((x) < (y) ? (x) : (y))#define max(x, y) ((x) > (y) ? (x) : (y))using namespace std;int n, m, ans = 1e9;int val[N], last[N];multiset <int> s, ss;multiset <int> :: iterator it;inline int read()inline void set_insert(int x)inline void insert(int x, int y)int main()for(i = 1; i <= m; i++)if(s[4] == 'G') printf("%d\n", *ss.begin());if(s[4] == 'S') printf("%d\n", ans);}return 0;}