摘要：
https://leetcode.cn/problems/count-submatrices-with-top-left-element-and-sum-less-than-k/description/ int countSubmatrices(int** grid, int gridSize, i 阅读全文
摘要：
https://leetcode.cn/problems/corporate-flight-bookings/description/ int* corpFlightBookings(int** bookings, int bookingsSize, int* bookingsColSize, in 阅读全文
摘要：
https://leetcode.cn/problems/check-if-all-the-integers-in-a-range-are-covered/description/ class Solution { public: bool isCovered(vector<vector>& ran 阅读全文
摘要：
https://www.luogu.com.cn/problem/P1102 include <bits/stdc++.h> define ll long long using namespace std; const int N = 2e5 + 10; int n , c; int a[N]; i 阅读全文
摘要：
//https://www.luogu.com.cn/problem/P2249 include using namespace std; int n,m,q,a[1000005]; int find(int x) { int l=1,r=n; while (l<r) { int mid=l+(r- 阅读全文
摘要：
bool hasIncreasingSubarrays(int* nums, int numsSize, int k) { int i; for(i=0;i<=numsSize-(2*k);i++){ int tmp=i; while(tmp<i+k-1){ if(nums[tmp]<nums[tm 阅读全文