hdu
@阿奇@
做一个勤勉、有趣、善良的人
展开
-
HDU4282
#include <iostream>#include <cstdio>#include <cstring>using namespace std;const __int64 maxn=1<<16;__int64 k;__int64 a[maxn][32];const __int64 MAX=2147483648;//1<<31必须这样写……void init()//我通过打印乘方表原创 2017-10-18 13:45:38 · 361 阅读 · 0 评论 -
hdu4414
#include <iostream>#include <stdio.h>using namespace std;int n;char map[60][60];int dfs(int x,int y){ for(int i=1;;i++) { if(map[x-i][y]!=map[x+i][y]) return 0; if(map[x][y-i原创 2017-10-22 12:49:33 · 291 阅读 · 0 评论 -
hdu4022
#include <map>#include <iostream>#include <set>#include <stdio.h>using namespace std;int n,m;map<int,multiset<int> > x;map<int,multiset<int> > y;int boom(int c,int d){ int ans; if(c)原创 2017-11-01 10:09:04 · 135 阅读 · 0 评论 -
hdu5884
#include<stdio.h>#include<iostream>#include<queue>#include <algorithm>using namespace std;int n,m;long long t;int a[100010],front_sum[100010];priority_queue<int,vector<int>,greater<int> >q;boo原创 2017-12-02 15:27:42 · 271 阅读 · 0 评论 -
hdu4417
#include <iostream>#include <stdio.h>#include <string.h>#include <algorithm>#define N 100010using namespace std;int n,m;int cnt[N*4],ans[N];struct node{ int h; int pos; bool operat原创 2017-12-14 16:17:13 · 205 阅读 · 0 评论 -
hdu1711
模板题:#include <iostream>#include <stdio.h>using namespace std;int NEXT[10010];int s[1000010],p[10010];int n,m;void GetNEXTval(){ int pLen = m; NEXT[0] = -1; int k = -1; int j = 0;原创 2017-12-06 15:18:23 · 181 阅读 · 0 评论 -
hdu2586
# include <iostream># include <cstdio># include <cstring># include <string># include <cmath># include <vector># include <map># include <queue># include <cstdlib># define MAXN 40001using names原创 2017-12-04 14:18:53 · 113 阅读 · 0 评论