题目: 考察点: 差分数组,思维。分析: Code： #include <set> #include <map> #include <stack> #include <queue> #include <deque> #include <vector> #include <cstdio> #include <string> #include <cstring> #include <iostream> #include <algorithm> #define ...

题目: 考察点: 二分--假设某个值存在。侃侃: 这道题可以说是二分中的一道模板题,我们先假设某个值成立,然后带入到已知条件中,判断当前值 是否满足所有的条件,若满足条件,看是否是最优的,如果不是最优的(还有更优的),就进一步缩小 范围,直到找到一个最优的值。Code: #include <cstdio> #include <string> #include <cstring> #include <iostream> #include <algorithm> using namespace std; const int maxn...

题目: 考察点: 树上DFS、long long、思维侃侃: 之前做过一道类似的题目,所以想到应该往哪个方向去想。 Code: #include <vector> #include <cstdio> #include <string> #include <cstring> #include <algorithm> using namespace std; typedef long long LL; const int maxn = 1e5 + 10; vector<int>G[maxn]; int deep[ma...

题目: 样例: 题目链接: 月月查华华的手机#析题得侃: Code: #include <vector> #include <cstdio> #include <string> #include <cstring> #include <iostream> #include <algorithm> using namespace std; const int maxn = 1e6 + 10; string a,b; int n; vector<int>ve[maxn]; int main(void...

https://www.cnblogs.com/prjruckyone/

https://www.cnblogs.com/prjruckyone/p/12236160.html

https://www.cnblogs.com/prjruckyone/p/12309466.html#_caption_7

https://www.cnblogs.com/prjruckyone/p/12293330.html

https://www.cnblogs.com/prjruckyone/p/12274968.html

/*注释掉的那行必须在循环外面返回 0 才行，为啥在里面提交时会显示运行超时？恳请大佬帮忙*/ #include<cstdio> #include<iostream> #include<algorithm> #include<cstring> #include<queue> using namespace std; const int maxn = 105; struct node {     int x,y,r;     int time;     friend bool operator < (node a,node...

#include<cstdio> #include<iostream> #include<algorithm> #include<cstring> #define INF 0x3f3f3f3f using namespace std; const int maxn = 10000005; long long dot[100005]; int flag[maxn]; long long dot1[100005]; int main(void) {     int n;     long long a,b;     bool flag1 = fals...