- 博客(159)
- 问答 (3)
- 收藏
- 关注
RSS订阅原创 POJ2187 n个点找距离最远的点对距离 graham 凸包
#include <cstdio>#include <iostream>#include <algorithm>using namespace std;struct point{ int x,y;};bool mult(point sp,point ep,point op){ return (sp.x-op.x)*(ep.y-op.y) >= (ep.x-op.x)*(s
2015-10-27 21:56:16
759
原创 POJ2932 扫描线
#include <cstdlib>#include <cstdio>#include <iostream>#include <vector>#include <set>#include <algorithm>using namespace std;double x[400005];double y[400005];double r[400005];int n;int inside(
2015-10-27 20:51:23
502
原创 hdu4778状态压缩dp 博弈
#include #include #include using namespace std;int g,b,s;int cc[30][10];int dp[1<<21];int dfs(int status,int num[],int lef){ //cout << status << endl; if(lef == 0) return dp[status] =
2015-09-26 22:39:07
461
原创 大视野2038 小z的袜子 莫队算法
#include <cstdio>#include <iostream>#include <algorithm>#include <cmath>#include <cstring>using namespace std;#define LL long long int n,m;int a[500005];struct node{ int l,r; int id;}Q
2015-09-26 10:21:29
407
原创 hihocoder1067 离线LCA
#include #include #include #include using namespace std;map ma;string sttr[200006];vector vec[200005];vector mat[200005];vector all[200005];map > ans;int vis[200005];int cnt = 1;int n,m
2015-09-25 19:10:53
443
原创 codeforces#320ABCD
题目 A#include <cstdio>#include <iostream>using namespace std;int main(){ unsigned int n; cin >> n; int cc = 0; while(n){ if(n&1){ cc++; } n >>= 1;
2015-09-17 18:50:55
390
原创 hihocoder1128&1097&1141
1128#include <cstdio>#include <iostream>using namespace std;#define LL long longint main(){ int n,k; scanf("%d%d",&n,&k); int flag = 0; int l = 0; int r = 0; for(int i = 0;i
2015-09-16 22:27:34
378
原创 hdu 5444 Elven Postman
#include <cstdio>#include <iostream>#include <map>#include <cstring> using namespace std;int fa[1005];int a[1005];char ans[1005];void fun(int l,int r,int loc,int f,char ch){ //cout << l <<"
2015-09-15 15:50:21
336
原创 codeforces#312ABC
题目 A#include <cstdio>#include <iostream>#include <cstring>#include <algorithm>using namespace std;struct node{ int x,y; bool operator <(const node& a)const { return x < a.x; }
2015-09-11 05:44:16
670
原创 hihocoder1050 & 1081 & 1093
1050#include <cstdio>#include <iostream>#include <vector>#include <cstring>using namespace std;vector<int> vec[100005];int vis[100005];int d[100005];int dfs(int x,int st){ vis[x] = 1; int
2015-09-09 10:46:58
430
原创 hihocoder1163 nim博弈
点击查看题目#include <cstdio>#include <iostream>using namespace std;int main(){ int n; cin >> n; int x = 0; for(int i = 0;i < n;i++){ int a; cin >> a; x ^= a; }
2015-09-07 21:58:48
347
原创 codeforces#PI ABC
A#include <cstdio>#include <iostream>#include <algorithm>using namespace std;int a[100005];int main(){ int n; cin >> n; for(int i = 1;i <= n;i++){ scanf("%d",&a[i]); } a[0
2015-09-07 20:06:22
382
原创 hihocoder1158质数相关，最大独立集
#include <cstdio>#include <iostream>#include <map>#include <cstring>#include <vector>#include <algorithm>using namespace std;int pre[500005];int n;int c[1004];int vis[1004];int a[1004];vecto
2015-09-04 18:55:33
509
原创 hihocoder1143矩阵快速幂 & hihocoder 1051 & hihocoder 1049 & hihocoder1066
#include <cstdio>#include <iostream>#include <map>#include <vector>using namespace std;int A[2][2];int B[2][2];const int mod = 19999997;int mul(int a[][2],int b[][2]){ int C[2][2] = {0};
2015-09-04 09:40:05
400
原创 hihocoder1041
#include <cstdio>#include <iostream>#include <map>#include <vector>#include <queue>#include <cstring>using namespace std;int n,m;vector<int> vec[105];int vis[105][105];#define INF 10000000int
2015-09-03 21:02:45
498
原创 hdu 5424 dfs
#include <cstdio>#include <iostream>#include <cstring>#include <vector>#include <queue>using namespace std;int ma[1005][1005];int vis[1005];int n;int d[1005];#define INF 1000000int bfs(int u
2015-09-03 10:40:21
452
原创 hihocoder1224
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <stack>#include <cstring>#include <vector>using namespace std;vector<int> vec[100005];int d[100005];int dfs(int
2015-09-01 20:12:12
376
原创 hihocoder1223
#include <cstdio>#include <iostream>#include <map>#include <cstring>using namespace std;char s[105][10];char op[105][10];int d[105];int main(){ int n; cin >> n; for(int i = 0;i < n;i
2015-09-01 20:10:40
518
原创 codeforces#318ABCD
点击查看题目 A#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace
2015-08-31 19:20:29
710
原创 。
在最近的几次比赛中我感觉自己能力越来越不行了。最近几次的比赛中我越来越感觉到自己思维的局限，一旦我有一个想法我就会一直陷在这个想法之中，有时候这个想法是对的，但是大多数时候这个想法并不对，这让我很苦恼，有时候我进入一种想法之后我就再也出不来了。 我觉得以后我在思考的时候要先想想自己是不是错了而不要想自己是不是对了，这种思想应该铭记于心，这种游戏玩的脑子，别总是想到对的方面要全面思考自己的逻辑是不是
2015-08-30 03:56:51
438
原创 POJ 1077 Eight IDA*
#include <cstdio>#include <iostream>#include <algorithm>using namespace std;int a[10];int goal[][2] = {{0,0},{0,0},{0,1},{0,2},{1,0},{1,1},{1,2},{2,0},{2,1},{2,2}};int move[4][2]={{-1,0},{0,-1},{0
2015-08-27 21:33:44
895
原创 POJ2676 2918 Sudoku 暴搜
#include <cstdio>#include <iostream>#include <iostream>#include <algorithm>using namespace std;int s[][2] = {{1,1},{1,4},{1,7},{4,1},{4,4},{4,7},{7,1},{7,4},{7,7}};int a[10][10];int ch[] = {0,0,
2015-08-25 22:13:32
771
原创 POJ3734Blocks矩阵快速幂加dp思想
#include <cstdio>#include <algorithm>#include <iostream>#include <vector>using namespace std;typedef vector<int> vec;typedef vector<vec> mat;const int M=10007;typedef long long LL;mat mul(mat &A
2015-08-25 19:40:39
649
原创 AIZU2303marathon match 概率
#include <cstdio>#include <iostream>#include <cstring>#include <cmath>using namespace std;#define LL long longdouble p[200];int t[200];int v[200];LL C[100][100];double dp[105][55];int main(){
2015-08-25 09:23:46
507
原创 CF#315 C
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#de
2015-08-24 14:39:24
619
原创 hdu 4007 平行矩形包含点数
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#de
2015-08-24 08:23:09
642
原创 CF#317D dp
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-23 20:49:02
666
原创 hdu 5418 状压dp
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-22 23:04:26
857
原创 多校连萌15-8-12#A
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-22 22:21:54
647
原创 hdu 4372 第一类斯特林数
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-21 21:27:23
710
原创 POJ 2785 折半枚举
#include <cstdio>#include <iostream>#include <algorithm>#define LL long long using namespace std;int a[4][4005];int b[2][4005*4005];int main(){ int n; while(cin >> n){ for(int i
2015-08-21 16:59:36
698
原创 POJ 3276 反转问题
#include <cstdio>#include <iostream> #include <cstring>using namespace std;int n;int a[5005][2];int flag[5005];int fun(int x){ int sum = 0; int res = 0; memset(flag,0,sizeof(flag));
2015-08-20 22:00:43
593
原创 NUBT 1580 素数分解 母函数法解
#include <cstdio>#include <iostream>#include <queue>#include <cmath>using namespace std;int pre[209];int ans[209];int tmp[409];int main(){ int sq= (int)sqrt(209.0); for(int i = 0;i <= 2
2015-08-16 14:13:55
834
原创 hdu 5375 dp
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-12 13:18:08
603
原创 hdu 5371 manachar
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-12 13:14:55
576
原创 hdu 2665 划分树
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-10 22:20:27
575
原创 hihocoder 1032 manachar 求回文串O(n)
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-10 09:59:39
552
原创 hdu 1078 记忆化搜索
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-09 16:17:31
468
原创 hdu 1058 水题+”英文题“
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-09 14:57:33
641
原创 hdu 1506 dp
#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <cmath>#include <cstring>#include <stack>#include <set>#include <map>#include <vector>using namespace std;#def
2015-08-08 22:34:46
395
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人