weixin_45826833的博客

参考博客参考博客题目链接#include<stdio.h>#include<stdlib.h>#include<algorithm>#include<string.h>//#define ll long long #define MAXN 100010#define INF 0X3f3f3f3f#include<iostream>#include<vector>#include<stack>#inc

//欧拉线性筛int primes[MAXN];//从primes[1]开始记录 bool book[MAXN];//合数为trueint cnt;//素数的个数 void eulershai(int n){//计算1~n的素数 for(int i=2;i<=n;i++){ if(!book[i]) primes[++cnt]=i;//如果没有筛过，记录素数 for(int j=1;j<=cnt;j++){ if(primes[j]*i>n) break;//保证小

参考博客

https://www.cnblogs.com/jason2003/p/9676729.html

参考博客

参考博客

思路：打表后发现是杨辉三角#include<stdio.h>#include<stdlib.h>#include<algorithm>#include<string.h>#define ll long long #define MAXN 10010#define INF 0X3f3f3f3f#include<iostream>#include<vector>#include<stack>#include

模板参考蓝书参考题解HDU 4738#include<stdio.h>#include<stdlib.h>#include<algorithm>#include<string.h>#define ll long long #define MAXN 10010#define INF 0X3f3f3f3f#include<iostream>#include<vector>#include<stack>co

参考题解https://vjudge.net/contest/383094#problem/C

https://vjudge.net/contest/383000#problem/C参考tarjan模板参考题解#include<stdio.h>#include<stdlib.h>#include<algorithm>#include<string.h>#define ll long long #define MAXN 1000010#define INF 0X3f3f3f3f#include<iostream>#incl

https://vjudge.net/contest/382787#problem/Jl参考博客注意：在floyd中，e[i][i]必须是0，不能为其他数 ，否则会出错#include<bits/stdc++.h>#define ll long long #define MAXN 310#define INF 0X3f3f3f3fconst ll inf=1e18;using namespace std;int n,m;ll l;ll e[MAXN][MAXN];int

https://vjudge.net/contest/382787#problem/A参考博客linkdijkstra参考模板linkBearland consists of N cities, numbered 1 through N. Cities are connected with bidirectional roads.Cities 1 through K were built a long time ago, when citizens liked order and regulari

https://vjudge.net/contest/382451#problem/C对每个数字，用到的性质只有其每一位的奇偶性，故其每一位可以用0和1来表示Today Sonya learned about long integers and invited all her friends to share the fun. Sonya has an initially empty multiset with integers. Friends give her t queries, each of

https://vjudge.net/contest/382451#problem/E解题思路：求将序列变成严格上升序列的最少操作次数，考虑 i < j ，则有a[j] - a[i] >= j - i , a[i]-i <= a[j]-j ，即等价于求 a[x]-x 的非严格上升序列的最少操作次数（POJ3666,参考博客链接: link）；dp[i][j]表示第i个数变为排序后的第j个数（b[j]）所需要的最少操作次数，则dp[i][j]=min (dp[i-1][k])+abs(

题解参考博客：linkbitset的用法：link代码（WA，应该是因为不能判断同一个位置多个大飞船的情况）#include<bits/stdc++.h>#define ll long long #define MAXN 200010using namespace std;int n,m;int cnt;int a[65];int b[65];map<double,int> mp;bitset<130>X[3610];void pre(){

https://vjudge.net/contest/382704#problem/E题目大意：每行输入n个数，一共两行，取过一个数之后，不能再取和它相邻的数（不包括对角相邻），问取数总和最大为多少解题思路：前 i-1 列已经处理完毕，dp[0][i]表示取走第 i 列的第1个，dp[0][i]取走第 i 列的第2个，dp[2][i]表示第 i 列两个都不取参考博客：link#include<bits/stdc++.h>#define ll long long #define MA