bettle_king的博客

https://codeforces.com/problemset/problem/600/B#include<bits/stdc++.h> using namespace std;const int N=1e5*2+10;int a[N],b[N],n,m;int main(void){ cin>>n>>m; for(int i=0;i<n;i++) cin>>a[i]; for(int i=0;i<m;i++) cin&gt.

https://codeforces.com/problemset/problem/1538/C我其实一直想不懂的是，为啥可以直接先排序，这样不就打乱了原来的顺序了么？后来发现无所谓啊，我们排序后的也是满足的。#include<bits/stdc++.h>using namespace std;const int N=1e5*2+10;int t,a[N],n,l,r;int main(void){ cin>>t; while(t--) { cin>.

https://codeforces.com/problemset/problem/279/B#include<bits/stdc++.h>using namespace std;const int N=1e5+10;int a[N],s[N],n,m;bool check(int len) { for(int i=1;i<=n-len+1;i++) if(s[i+len-1]-s[i-1]<=m) return true; return false;}in.

https://codeforces.com/problemset/problem/474/B#include<bits/stdc++.h>using namespace std;typedef long long int LL;const int N=1e5+10;LL a[N],s[N],n,m;int main(void){ cin>>n; for(int i=1;i<=n;i++) cin>>a[i],s[i]=s[i-1]+a[i];.

https://codeforces.com/problemset/problem/706/B#include<bits/stdc++.h>using namespace std;const int N=1e5+10;int a[N],n,m,x;int main(void){ cin>>n; for(int i=0;i<n;i++) cin>>a[i]; sort(a,a+n); cin>>m; while(m--) { .

https://leetcode-cn.com/problems/B1IidL/O(n)的方法class Solution {public: int peakIndexInMountainArray(vector<int>& arr) { int n=arr.size()-1; int ans=0; for(int i=1;i<=n-1;i++) { if(arr[i]&.

https://www.luogu.com.cn/problem/P1296先从小到大排序，再用二分查找每一个数的范围内的人数。#include<cstdio>#include<iostream>#include<algorithm>using namespace std;const int N=1e6+10;int a[N];int f(int l,int r,int x){ int temp=l; while(l<r) { int .