摘要：
题目链接:https://www.luogu.com.cn/problem/P2249 题解代码: #include<iostream> using namespace std; int n, m, q, a[1000005]; int find(int x); int main() { cin > 阅读全文
摘要：
题目链接:https://leetcode.cn/problems/adjacent-increasing-subarrays-detection-ii/ 题解代码: int maxIncreasingSubarrays(int* nums, int numsSize) { int ans = 0, 阅读全文
摘要：
题目链接: https://leetcode.cn/problems/minimum-element-after-replacement-with-digit-sum/ 题解代码: int minElement(int* nums, int numsSize) { int temp=10000; w 阅读全文