![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数据结构
文章平均质量分 53
E_Windrunner
这个作者很懒,什么都没留下…
展开
-
HDU 1022
#includeint main(){ char a[10000],b[10000],s[10000]; int i,n,top,f[10000],j,count; while(scanf("%d",&n)!=EOF) { getchar(); for(i=0;i<n;i++) a[i]=getchar()原创 2012-03-07 13:14:16 · 359 阅读 · 0 评论 -
HDU 1403 Longest Common Substring
好久没学新算法了,从现在开始努力吧。花了3天时间看了后缀数组的论文,差不多看明白了,贴上一份应用的代码吧。#include #include #include #include #include #include #include #include #include #include #include #include #define MP make_pair#d原创 2013-05-29 10:26:19 · 443 阅读 · 0 评论 -
HDU 1541 Stars
看起来是二维,其实用一维数组就可以解决了。#include #include #include #include #include #include #include #include #include #include #define ll long long#define MP make_pair#define PB push_back#define SZ(x)原创 2013-02-26 23:37:58 · 260 阅读 · 0 评论 -
POJ 1971 Parallelogram Counting
4485ms,擦边球?。。。。下面还有一份优化版代码。。563ms#include#include#include#include#includeconst long long maxsize = 0x1fffff;const int maxn = 1010;using namespace std;struct Point{ int x,y;}p[maxn]原创 2012-08-26 22:23:58 · 333 阅读 · 0 评论 -
HDU 1394 Minimum Inversion Number
#include#include#include#include#include#include#include#includeusing namespace std;const int maxn = 5050;struct SegmentTree{ int left,right,val,mid;}tr[maxn<<2];void build(int lef原创 2012-09-02 20:56:00 · 226 阅读 · 0 评论 -
HDU 2642 Stars
二维树状数组,593ms,慢得一塌糊涂。。#include#include#include#include#include#include#include#includeusing namespace std;const int maxn = 1010;bool vis[maxn][maxn];int cnt[maxn][maxn];void swap(int&原创 2012-09-02 22:48:49 · 250 阅读 · 0 评论 -
HDU 3577 Fast Arrangement
成段更新的线段树- -!#include#include#include#include#include#include#includeusing namespace std;#define maxn 1000010#define l(i) ((i)<<1)#define r(i) ((i)<<1|1)struct node{ int left,原创 2012-08-14 20:07:13 · 415 阅读 · 0 评论 -
HDU 1166 敌兵布阵
线段树基础题#include#include#include#include#define maxn 50010int num[maxn],flag,ans;struct{ int left,right,mid,cnt;}tr[maxn<<2];void build(int s,int t,int k){ if(s==t) { tr[原创 2012-07-20 17:05:20 · 250 阅读 · 0 评论 -
UVa 11234 Expressions
原来这题要用树……看了别人的解题报告才明白#include#include#includestruct tree{ tree *left,*right; char op;}*stack[10010],*queue[10010];char s[10010];tree *creat1(char c){ tree *nt=new tree; nt->l转载 2012-07-11 13:19:41 · 245 阅读 · 0 评论 -
UVa 11111 Generalized Matrioshkas
这题号……#include#include#includestruct{ int cnt,val;}stack[10000];int a[10000],n=0;int solve(){ int i,top; memset(stack,0,sizeof(stack)); for(i=top=0;i<n;i++) { if(a转载 2012-07-10 18:28:21 · 329 阅读 · 0 评论 -
UVa 673 Parentheses Balance
#include#include#includeint main(){ char stack[150],c,s[150]; int t,i,top; scanf("%d",&t); getchar(); while(t--) { gets(s); int len=strlen(s); for(i原创 2012-07-09 23:15:21 · 262 阅读 · 0 评论 -
UVa 442 Matrix Chain Multiplication
#include#include#includestruct{ int row,col;}a[30];int main(){ int n,i,r,w,top1,top2,sr[1000],sc[1000],ans; char c,s[1000],s1[1000]; while(scanf("%d",&n)!=EOF) { get原创 2012-07-10 00:58:34 · 259 阅读 · 0 评论 -
UVa 101 The Blocks Problem
坑爹啊,中间输出没去掉,检查了好久……略恶心的一道题- -#include#include#includeint main(){ int st[30][30],a,b,n,top[30],i,j; char s1[10],s2[10]; while(scanf("%d",&n)!=EOF) { for(i=0;i<n;i++)原创 2012-07-07 21:00:05 · 242 阅读 · 0 评论 -
HDU 2852 KiKi's K-Number
因为一个输出超时N次。#include #include #include #include #include #include #include #include #include #include #define ll long long#define MP make_pair#define PB push_back#define SZ(x) ((int)(x原创 2013-02-25 22:03:15 · 269 阅读 · 0 评论