摘要：
```c++ #include using namespace std; typedef long long ll; const int Maxn = 1e5+10; const int Inf = 0x7f7f7f7f; const int Mod = 1e9+7; int a[Maxn],v[Maxn]; int l_0[Maxn],r_1[Maxn]; double ans[Maxn]; i 阅读全文
摘要：
```c++ #include using namespace std; typedef long long ll; const int Maxn = 1e6+10; const int Inf = 0x7f7f7f7f; const int Mod = 998244353; int n,m; char s[12000010]; priority_queue ,greater > Map[Maxn 阅读全文