2014年02月_yamiedie_

原创 CF 232 div2 E On Changing Tree 树状数组

dfs把树上的节点映射到[1,n],l[u]到r[u]表示节点u的儿子的范围，然后用树状数组搞。#include#include#include#include#include#include#include#include#includeusing namespace std;#define inf 0x3f3f3f3f#define eps 1e-8#define

2014-02-28 16:56:45 776

原创 HDU 1398 Square coins 完全背包

#include#include#include#include#include#include#include#include#includeusing namespace std;#define inf 0x3f3f3f3f#define eps 1e-8#define ll long long #define ull unsigned long long#def

2014-02-23 22:56:29 559

原创 HDU 1069 Monkey and Banana

#include#include#include#include#include#include#include#include#includeusing namespace std;#define inf 0x3f3f3f3f#define eps 1e-8#define ll long long #define ull unsigned long long#def

2014-02-23 22:33:29 668

原创 HDU 3845 凸包

#include#include#include#include#include#include#include#include#includeusing namespace std;#define mxn 1020#define inf 0x3f3f3f3f#define eps 1e-8#define LL long long #define ull unsign

2014-02-23 17:00:44 719

原创 POJ 2796 单调栈~

#include#include#include#include#include#include#include#include#includeusing namespace std;#define mxn 102000#define inf 0x3f3f3f3f#define eps 1e-8#define LL long long #define ull unsi

2014-02-23 13:30:42 563

原创 POJ 2559 单调栈

#include#include#include#include#include#include#include#include#includeusing namespace std;#define mxn 102000#define inf 0x3f3f3f3f#define eps 1e-8#define LL long long #define ull unsi

2014-02-23 12:54:18 578

转载素数检测-Miller_Rabin算法-hoj1356

一、先介绍几个定理费马小定理，二次探测定理参考：http://baike.baidu.com/，http://blog.csdn.net/iyundi/article/details/99553531、费马小定理著名的费马小定理为素数判定提供了一个有力的工具.费马小定理:如果p是一个素数,且(0则证明是容易的.2、二次探

2014-02-20 11:53:05 733

原创 POJ3281 网络流 dining

#include#include#include#include#include#include#include#include#includeusing namespace std;#define mxn 820#define inf 0x3f3f3f3f#define ll long long #define ull unsigned long long#def

2014-02-17 20:32:42 578

原创 POJ1459 网络流

#include#include#include#include#include#include#include#include#includeusing namespace std;#define mxn 120#define inf 0x3f3f3f3f#define ll long long #define ull unsigned long long#def

2014-02-17 20:01:00 534

原创 HDU2222 AC自动机

#include#include#includeusing namespace std;struct node { int cnt; node * fail; node * nxt[26];}*q[500400], pool[500300];node * root;char t[1002000], w[1020];int sz;node* creat()

2014-02-16 21:31:23 543

原创 HDU2191 多重背包(二进制思想)

#include#include#includeusing namespace std;#define mxn 202int n, v;int p[mxn], h[mxn], c[mxn];int dp[mxn];int main() { int cas; scanf( "%d", &cas ); while( cas-- ) { scanf( "%d%d", &v, &

2014-02-16 16:21:58 624

原创最短路dijkstra(堆实现)

#include#include#includeusing namespace std;#include#define inf 0x3f3f3f3f#define mxn 2002struct point { int num,c; bool operator < ( const point & b ) const { return c < b.c; } bool oper

2014-02-16 15:57:35 565

原创最短路spfa

#include#include#includeusing namespace std;#define mxn 10020#define inf 0x3f3f3f3fint first[mxn], nxt[mxn], to[mxn], cost[mxn], e;void add( int u, int v, int c ) { to[e] = v; cost[e] = c; n

2014-02-16 15:55:34 542

原创乘法逆元(扩展欧几里得)

#include#include#includeusing namespace std;//如果 a % b == 0, c 是 b 模 m ( 质数 ) 下的逆, ( a / b ) % m = ( a * c ) % m.int exgcd( int a, int b, int & y ) { if( b == 0 ) { y = 0; return 1; } int

2014-02-16 15:51:07 778 1

原创 HDU1556 前缀和

#include#include#includeusing namespace std;#define mxn 100020int sum[mxn],s[mxn];int main(){ int n; while(scanf("%d",&n)&&n){ memset(sum,0,sizeof(sum)); memset(s,0,sizeof(s)); for(int i

2014-02-16 15:10:13 689

原创 HDU1556 线段树

#include#include#includeusing namespace std;#define mxn 100020int ll[mxn << 2], rr[mxn << 2], sum[mxn << 2], add[mxn << 2];//建树void build( int l, int r, int i ) { rr[i] = r, ll[i] = l; if( l

2014-02-16 15:07:30 718

原创 POJ2299 归并求逆序数

#include#include#includeusing namespace std;#define mxn 500040#define ll long longll cnt;void merge_sort( int * A, int x, int y, int * T ) { if( y - x > 1 ) { int m = x + ( y - x ) / 2; in

2014-02-13 17:43:42 555

原创快速排序

#include#include#include#include#include#include#include#include#includeusing namespace std;const double eps = 1e-10;const int inf = 0x3f3f3f3f;const int mxn = 50020;int part( int *arr,

2014-02-13 17:32:24 515

原创 POJ3461 KMP

#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define ll long long #define ull unsigned long long #define mxn 1002000#defi

2014-02-13 17:10:40 593

原创 POJ3461 字符串哈希