shenqimaomaoxia

摘要： 题目链接：https://www.luogu.com.cn/problem/P1803 #include <iostream> #include <algorithm> #include <vector> using namespace std; int main(){ int ui; cin>>u 阅读全文

摘要： 题目链接：https://www.luogu.com.cn/problem/P1223 ＃include < iostream> ＃include < algorithm> using namespace std; int main(){ int num; cin>>num; long long a 阅读全文

摘要： 题目链接：https://codeforces.com/contest/2005/problem/B1 （开局看掉m=2和q=1） include include using namespace std; int main(){ long u; cin>>u; for(;u>0;u--){ long 阅读全文

摘要： 题目链接：https://leetcode.cn/problems/corporate-flight-bookings/ int* corpFlightBookings(int** bookings, int bookingsSize, int* bookingsColSize, int n, in 阅读全文

摘要： 题目链接：https://leetcode.cn/problems/car-pooling/ bool carPooling(int** trips, int tripsSize, int* tripsColSize, int capacity) { int arr[1100]; int max=0 阅读全文

摘要： 题目链接：https://leetcode.cn/problems/check-if-all-the-integers-in-a-range-are-covered/description/ bool isCovered(int** ranges, int rangesSize, int* rang 阅读全文

摘要： 题目链接：https://codeforces.com/contest/2031/problem/B include using namespace std; int main(){ int n; cin>>n; for(int ni=0;ni<n;ni++){ int num; cin>>num; 阅读全文

摘要： include using namespace std; int main(){ int p,sum; cin>>p>>sum; int arr[p]; for(int i=0;i<p;i++){ cin>>arr[i]; } for(int i=1;i<=sum;i++){ int mubiao; 阅读全文

摘要： bool hasIncreasingSubarrays(int* nums, int numsSize, int k) { if (numsSize < 2 * k - 1) {return false;} if(k1){return true;} a:for(int u=0;u<numsSize- 阅读全文