![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
CSP
qq_45795651
这个作者很懒,什么都没留下…
展开
-
【练习记录】202006-2 稀疏向量
202006-2 稀疏向量Tips:记得用long long思路:HashMap#include<iostream>#include<map>using namespace std;int n, n1, n2; int main(){ long long a, b, sum = 0; map<int, int> u; cin >> n >> n1 >> n2; while (n1--) { cin >&原创 2021-11-21 02:45:16 · 79 阅读 · 0 评论 -
【练习记录】 202009-2 风险人群筛查
202009-2 风险人群筛查#include<iostream>using namespace std;int n, k, t, xl, yl, xr, yr;bool isIn(int x,int y) { if (x >= xl && x <= xr && y >= yl && y <= yr) return true; return false;} int main(){ int x, y; b原创 2021-11-21 01:51:19 · 59 阅读 · 0 评论 -
【练习记录】202104-2 邻域均值
202104-2 邻域均值70分代码(纯暴力)#include<iostream>using namespace std;const int N = 1000;int a[N][N];int n, L, r, t;bool isB(int x,int y) { x += 200, y += 200; int count = 0, sum = 0; for (int i = x - r; i <= x + r; i++) { for (int j = y - r; j原创 2021-11-19 15:13:30 · 323 阅读 · 0 评论 -
【练习记录】202104-1 灰度直方图
202104-1灰度直方图#include<iostream>using namespace std;const int N = 256;int n, m, l, t;int res[N] = { 0 };int main(){ cin >> n >> m >> l; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> t;原创 2021-11-19 13:50:12 · 316 阅读 · 0 评论 -
【练习记录】201912-2 回收站寻址
201912-2 回收站寻址纯暴力,生怕超时。。。#include<iostream>#include<vector>#include<algorithm>#include<map>using namespace std;int n;bool isFind(vector<vector<int>> a, int x, int y) { vector<int> t = { x,y }; vector<v原创 2021-11-19 00:33:41 · 435 阅读 · 0 评论 -
【练习记录】201912-1 报数
201912-1 报数#include<iostream>using namespace std;bool isJ(int n) { if (n % 7 == 0) return false; int a, b, c; while (n > 0) { if (n % 10 == 7) return false; n /= 10; } return true;}int main(){ int n, current = 1; int a[4] = { 0 };原创 2021-11-18 23:56:46 · 37 阅读 · 0 评论 -
【练习记录】 202109-2 非零段划分
202109-2 非零段划分#include<iostream>#include<algorithm>using namespace std;int n;const int N = 1e6;int nums[N], df[N];int pre = 0, maxS = 0;int main(){ cin >> n; for (int i = 1; i <= n; i++) cin >> nums[i]; n =原创 2021-11-18 22:29:13 · 167 阅读 · 0 评论 -
【练习记录】 202012-2 期末预测之ZUI JIA阈值
202012-2 期末预测之最佳阈值思想类似前缀和#include <iostream>#include<vector>#include<algorithm>#include<map>using namespace std;int n, a, b;map<int, vector<int>> dict;vector<int> start = { 0,0 };vector<int> keys;i原创 2021-11-17 22:30:16 · 63 阅读 · 0 评论 -
【练习记录】202006-1 线性分类器
#include <iostream>#include<vector>#include<algorithm>using namespace std;int n, m, x, y, a, b, c;char l;vector<vector<int>> point, point2;vector<int> res;int flag, flag2, resFlag = 1;int main() { while (cin &g原创 2021-11-17 03:07:45 · 37 阅读 · 0 评论 -
【练习记录】 202009-1 称检测点查询
#include <iostream>#include<vector>#include<algorithm>using namespace std;int n, a, b, x, y, d;vector<vector<int>> ds;bool ju(vector<int> a, vector<int> b) { if (a[1] == b[1]) return a[0] < b[0]; return原创 2021-11-17 02:27:06 · 185 阅读 · 0 评论 -
【练习记录】202012-1 期末预测之安全指数
下面展示一些 内联代码片。202012-1 期末预测之安全指数某菜鸟的csp练习,发布仅为督促自己之用。#include <iostream>using namespace std;int n, a, b, sum = 0;int main() { while (cin >> n) { while (n--) { cin >> a >> b; sum += a * b; } break; } cout <<原创 2021-11-17 01:45:50 · 205 阅读 · 0 评论