摘要:
#include <bits/stdc++.h> #define LL long long using namespace std; const int N = 2e5 + 10; int T, n, m, p; int w[N]; struct node { int l, r; int mul; 阅读全文
摘要:
#include <bits/stdc++.h> #define LL long long using namespace std; const int N = 2e5 + 10; int n, m; int w[N]; struct node { int l, r; int tag; }tr[N 阅读全文
摘要:
#include <bits/stdc++.h> #define LL long long using namespace std; const int N = 2e5 + 10; int n, m; int w[N]; struct node { int l, r; int Max; }tr[N 阅读全文
摘要:
#include <bits/stdc++.h> #define LL long long using namespace std; const int N = 1e5 + 10; int n, m, p; int w[N]; struct Node { int l, r; int sum, add 阅读全文
摘要:
#include <bits/stdc++.h> #define LL long long using namespace std; const int N = 1e5 + 10; int n, m; LL w[N]; struct node { int l, r; LL sum, add; }tr 阅读全文
摘要:
A 暴力 #include <bits/stdc++.h> using namespace std; int T, a, b; int main() { cin >> T; while (T -- ) { int n; cin >> n; vector<int> v; while (n) { v.p 阅读全文
摘要:
A #include <bits/stdc++.h> #define int long long using namespace std; int T, n, m; signed main() { cin >> n; int a = 2147483648; int b = a * -1; a --; 阅读全文
摘要:
A #include <bits/stdc++.h> using namespace std; int a[10010], b[10010]; int main() { int T; cin >> T; while (T -- ) { int n; cin >> n; for (int i = 1; 阅读全文
摘要:
A class Solution { public: int findFinalValue(vector<int>& nums, int original) { for (int i = 1; i <= 1000; i ++ ) { for (auto x : nums) { if (x == or 阅读全文