- 博客(22)
- 收藏
- 关注
原创 P2024 食物链(two)
luoguvijos两种方法一、带权并查集:问题 front做差#include<iostream>#include<cstdio> #include<cstring>#include<string>#include<algorithm>#include<queue>#include<vector>#include<cmath>using namespace std;int f[5
2017-02-26 11:26:06 385
原创 P1196 银河英雄传说
设置两个数组来记录后面的长度和前面的长度#include<iostream>#include<cstdio> #include<cstring>#include<string>#include<algorithm>#include<queue>#include<vector>#include<cmath>using namespace std;int behind[30010],f
2017-02-24 13:33:53 479
原创 P1892 团伙
朴素并查集#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#include<vector>#include<queue>using namespace std;int n,m;vector <int> dr[1001];int py[1001];int fi
2017-02-22 15:51:46 473
原创 P1546 最短网络(最小生成树)
题见洛谷最小生成树prim#include<iostream>#include<cstdio>#include<cstring>#include<string> #include<algorithm>using namespace std;int tu[101][101],dis[101],a[101];int main(){ //freopen("a.in","r",std
2017-02-10 11:37:06 273
原创 烦人的幻灯片
Page 527#include<iostream>#include<cstdio>#include<cstring>#include<string> #include<algorithm>using namespace std;int n;struct H{ int x1,x2,y1,y2;}card[30];struct K{ int x,y;}f[30];
2017-02-10 08:21:09 1346
原创 例4.15 奖金(拓扑排序)
#include<iostream>#include<cstdio>#include<cstring>#include<string> #include<algorithm>int n,m;int f[10001];int tree[10001][301];int r[10001],ans=0;using namespace std;int main(){ scanf(
2017-02-09 16:07:44 598
原创 P1156 垃圾陷阱(dp)有待理解
题见洛谷#include<iostream>#include<cstdio>#include<cstring>#include<string> #include<algorithm>using namespace std;int deep,n,maxl=0,anst=999999;struct H{ int tim,tall,last;}st[200];int f[200]
2017-02-09 09:46:10 371
原创 P1063 能量项链(区间dp)
题见洛谷#include<iostream>#include<cstdio>#include<cstring>#include<string> #include<algorithm>using namespace std;long long ans=0;int a[300],n,f[300][300];int main(){ scanf("%d",&n); for(
2017-02-08 16:35:36 335
原创 P1064 金明的预算方案
题见洛谷由于依赖少 , 可以改为分组背包 #include<iostream>#include<cstdio>#include<cstring>#include<string> #include<algorithm>using namespace std;int v[210],c[210],n,m,wj[210][3],wpv[210],wpc[210]; int f[32000+1
2017-02-08 15:03:57 585
原创 P1541 乌龟棋
题见洛谷记忆化搜索#include<iostream>#include<cstdio>#include<cstring>#include<string> #include<algorithm>using namespace std;int num[5],a0[400];int dp[40][40][40][40],ans=0;int n,m;int dfs(int x,int a,
2017-02-08 09:44:03 347
原创 P1074 靶状数独(优化)
题见洛谷#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<string>#include<cmath>#define LL long longusing namespace std;bool lief[10][10],hangf[10][10],gef[10][10];int
2017-02-07 16:39:18 272
原创 P1219 N皇后(位运算&普通dfs)
题见洛谷位运算版(设计巧妙,需要回顾,加深理解)#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<algorithm>#include<vector>#include<queue>using namespace std;int a[20];int ans=0,uplimit,n;
2017-02-07 15:06:43 198
原创 P1434 滑雪(记忆化搜索)
#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<algorithm>#include<vector>using namespace std;int ans[200][200];int tall[200][200];int dx[]={0,1,-1,0,0};int dy[]={0,
2017-02-07 11:20:30 234
原创 P1118 数字三角形(技巧)
题见洛谷 带有技巧的搜索,用到杨辉三角形 不难看出 第几个(k)拆的数(虽说并不是拆的),系数为杨辉三角第n行,第k列的数字#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<algorithm>#include<vector>using namespace std;int n,
2017-02-07 09:18:13 325
原创 P1162 填涂颜色
题见洛谷#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<string>#include<cmath>#include<vector>using namespace std;int a[40][40],n;bool f[40][40];int dx[]={0,1,-1,0,
2017-02-06 17:13:25 239
原创 P1141 01迷宫
题见洛谷#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<string>#include<cmath>#include<vector>bool f[1005][1005];char a[1005][1005];int dx[]={0,0,0,1,-1};int dy[]={0
2017-02-06 17:08:06 318
原创 P2685抓牛(bfs)
题见洛谷#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<string>#include<cmath>#include<vector>#define LL long long#define p 0.00000001using namespace std;int n,k;i
2017-02-06 11:43:23 406
原创 !算 24 (dfs)
总时间限制: 3000ms 内存限制: 65536kB 【】描述 给出4个小于10个正整数,你可以使用加减乘除4种运算以及括号把这4个数连接起来得到一个表达式。现在的问题是,是否存在一种方式使得得到的表达式的结果等于24。这里加减乘除以及括号的运算结果和运算的优先级跟我们平常的定义一致(这里的除法定义是实数除法)。比如,对于5,5,5,1,我们知道5 * (5 – 1 / 5) = 24,因此可
2017-02-06 09:42:19 315
原创 P1074 靶形数独(TLE 75)
题目#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<string>#include<cmath>#define LL long longusing namespace std;int lief[10][10],hangf[10][10],gef[10][10];int qu
2017-02-05 16:52:37 320
原创 高精 + & *
高精加 压位#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<string>#include<cmath>#define LL long longusing namespace std;int a[1000],b[1000],c[1000];char s1[1001],s2[
2017-02-05 10:02:26 228
原创 QBXT DAY1
1.枚举 2.前缀和维护 差值维护(详见上一篇) 3.最大字段和for (i=1; i<=n; i++){ sum+=a[i]; if (sum<0) sum=0; ans=max(ans,sum);}下见应用圈地运动(化面为线)求最大子区间和for (i=1; i<=n; i++) for (j=1; j<=n; j++) s[i][j]=s[i-
2017-02-04 10:03:23 196
原创 qbxt 差值维护
比线段树慢但是简洁一维差值维护对a数组进行m次操作,每次在l~r上加不同的值,最后输出ql~qr的区间和cha[i]=a[i]-a[i-1];//差值cha[l]+=k,cha[r+1]-=k;//差值维护//那么m次操作后a[i]=∑cha[1~i];s[i]=∑a[1~i];ans=s[r]-s[l-1];二维差值维护矩阵 左上角(x,y) 右下角(x2,y2)//此处需要画图帮助
2017-02-04 09:30:38 304
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人