08 2014 档案

poj_1974，最长回文字串manacher
摘要：时间复杂度为O(n)，参考：http://bbs.dlut.edu.cn/bbstcon.php?board=Competition&gid=23474#include#include#include#include#define maxn 2001000using namespace std;ch... 阅读全文
posted @ 2014-08-23 12:21 JarvisLau 阅读(180) 评论(0) 推荐(0)
hdu_4430，二分
摘要：注意处理溢出#include#include#include#includeusing namespace std;long long n;long long a[60][2];int k;int fun(long long y,int x){ long long cnt=0,cur=1; ... 阅读全文
posted @ 2014-08-21 17:33 JarvisLau 阅读(170) 评论(0) 推荐(0)
求凸包面积
摘要：#include#include#include#include#includeusing namespace std;struct Point{ double x,y; Point(double x=0,double y=0):x(x),y(y){}};typedef Point Ve... 阅读全文
posted @ 2014-08-21 14:00 JarvisLau 阅读(376) 评论(0) 推荐(0)
poj_2187求凸包直径
摘要：#include#include#include#include#includeusing namespace std;struct Point{ int x,y; Point(int x=0,int y=0):x(x),y(y){}};typedef Point Vector;bool... 阅读全文
posted @ 2014-08-21 13:58 JarvisLau 阅读(178) 评论(0) 推荐(0)
几何，求两整数点确定的线段上的整数点的个数
摘要：#include#include#include#include#includeusing namespace std;int gcd(int a,int b){ return a%b==0?b:gcd(b,a%b);}int main(){ int x1,x2,y1,y2; wh... 阅读全文
posted @ 2014-08-21 12:25 JarvisLau 阅读(229) 评论(0) 推荐(0)
zoj_3657,12年长春站c题，模拟
摘要：#include#include#include#includeusing namespace std;int main(){ int n; int a[6]; while(scanf("%d",&n)!=EOF) { for(int i=0;ians) ... 阅读全文
posted @ 2014-08-18 21:47 JarvisLau 阅读(134) 评论(0) 推荐(0)
poj_2352树状数组
摘要：因为y已经排好序了，用x坐标建立一维树状数组#include#include#includeusing namespace std;int n;int a[32001];int lev[15001];int lowbit(int x){ return x&(-x);}int sum(int x... 阅读全文
posted @ 2014-08-11 18:20 JarvisLau 阅读(128) 评论(0) 推荐(0)
poj_2187凸包，暴力解法
摘要：#include#include#include#include#includeusing namespace std;struct Point{ int x,y; Point(int x=0,int y=0):x(x),y(y){}};typedef Point Vector;bool... 阅读全文
posted @ 2014-08-11 10:03 JarvisLau 阅读(223) 评论(0) 推荐(0)
zoj_3735,dp,长沙站j题
摘要：#include#include#include#includeusing namespace std;double a[10010][150];double dp[10010][150];int b[10010];int n;void solve(int cnt){ memset(dp,0,... 阅读全文
posted @ 2014-08-10 07:37 JarvisLau 阅读(133) 评论(0) 推荐(0)
hdu_1698线段树成段更新
摘要：#include#include#include#include#define lson l,m,rt> 1)) * col[rt]; sum[rt> 1) * col[rt]; col[rt] = 0; }}void build(int l,int r,int rt){ c... 阅读全文
posted @ 2014-08-09 19:58 JarvisLau 阅读(158) 评论(0) 推荐(0)
poj_2828线段树，逆序插入
摘要：#include#include#include#include#define lson l,m,rt=p) { update(v,p,lson); } else { p-=sum[rt>n) { for(int i=0; i=... 阅读全文
posted @ 2014-08-09 12:50 JarvisLau 阅读(130) 评论(0) 推荐(0)
poj_3371
摘要：一道模拟题，写的有点麻烦#include#include#include#include#includeusing namespace std;bool fun(char c){ if(c=='a'||c=='A'||c=='e'||c=='E'||c=='i'||c=='I'||c=='o'... 阅读全文
posted @ 2014-08-08 21:11 JarvisLau 阅读(148) 评论(0) 推荐(0)
poj_3071概率dp
摘要：确定好对手就简单了。#include#include#include#includeusing namespace std;double a[150][150];double dp[9][150];int n;void solve(){ memset(dp,0,sizeof(dp)); ... 阅读全文
posted @ 2014-08-06 22:28 JarvisLau 阅读(114) 评论(0) 推荐(0)