slass-mot-odet

找出左边第一个比ai小的数的位置li与右边第一个比ai小的数的位置ri #include<bits/stdc++.h> using namespace std; #define maxn 3000010 typedef long long ll; ll INF=1e18; struct Tree{ int l,r; ll mi,mx; }tree[maxn<<2];...

题目描述 链接：https://ac.nowcoder.com/acm/contest/884/A 来源：牛客网 A new city has just been built. There’re nn interesting places numbered by positive numbers from 1 to n. In order to save resources, only exact...

链接：https://ac.nowcoder.com/acm/contest/884/K 来源：牛客网 题目描述 300iq loves numbers who are multiple of 300. One day he got a string consisted of numbers. He wants to know how many substrings in the string a...