far away

树状数组 ：http://blog.youkuaiyun.com/int64ago/article/details/7429868树状数组求最值：http://blog.youkuaiyun.com/u010598215/article/details/48206959线段树：http://www.cnblogs.com/TenosDoIt/p/3453089.htmlZKW线段树 ：http://www.c

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=6225 解析：求四个数的和，大整数加法 代码：import java.io.*;import java.math.BigInteger;import java.util.*;public class Main { public static Scanner s = new Scanner(

题目链接：http://acm.split.hdu.edu.cn/showproblem.php?pid=2586How far away ？Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 18268    Accept

#include #include #include #include #include #include #include #include #include using namespace std;#define rep(i,a,n) for (int i=a;i<n;i++)#define per(i,a,n) for (int i=n-1;i>=a;i--)#def

题目链接：https://www.51nod.com/onlineJudge/questionCode.html#!problemId=10221022 石子归并 V2基准时间限制：1 秒 空间限制：131072 KB 分值: 160 难度：6级算法题 收藏 关注N堆石子摆成一个环。现要将石子有次序地合并成一堆。规定每次只

题目链接：https://www.51nod.com/onlineJudge/questionCode.html#problemId=1021¬iceId=2766731021 石子归并基准时间限制：1 秒 空间限制：131072 KB 分值: 20 难度：3级算法题 收藏 关注N堆石子摆成一条线。现要将石子有次序地合并成

代码：int dij(){ int i, j, vis[N]; for(i = 1; i <= n; i++) vis[i] = mp[1][i]; vis[1] = 0; for(i = 1; i <= n; i++) { int m = 1, f = inf; for(j = 1;

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1269迷宫城堡Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17340    Accepted Submission(s)

代码1：http://blog.youkuaiyun.com/qq_34287501/article/details/52664138模板2：1.Dinic大牛板子struct Edge{ int u, v, cap, flow, next;}E[M];struct Dinic{ int head[N], d[N]; int tot, sink, source;

代码：int mp[N][N], book[N], pre[N]; int n; int max_flow() { int i, u, ans = 0; while(1) { memset(book, 0, sizeof(book)); memset(pre, 0, sizeof(pre));

代码：void e_gcd(LL a, LL b, LL &x, LL &y){ if(b == 0) { x = 1; y = 0; return ; } e_gcd(b, a % b, x, y); int tm = x; x = y; y = tm - a / b * y;}LL lucas(int

本人比较懒，用文字描述比较复杂，而且不易弄懂，所以给大家来个视频，我是按照视频的讲解，敲出下面的代码，求轻喷视频链接： http://www.bilibili.com/video/av3246487/阿三讲的kmp，挺不错的，推荐下，代码如下：#include#include#include#include#include#include#include#in

代码：char s[N];typedef struct node{ struct node *n[33]; int cnt; node() { cnt = 0; memset(n, 0, sizeof(n)); }}Q, *T;T root = new node();void Creat(){ T p

代码：void RMQ(int n){ for(int j = 1; j != 20; j++) { for(int i = 1; i <= n; i++) { if(i + (1<<j) - 1 <= n) dp[i][j] = max(dp[i][j - 1], dp[i + (1>1)][j

代码：int main(){ while(~scanf("%d", &n)) { for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j++) scanf("%d", &mp[i][j]); int ans =KM(); print

代码：#include#include#include#include#include#include#include#include#include#include#define N 909using namespace std;const int inf = 0x3f3f3f3f;const int mod = 10000007;int mp[N][N], m,

其实就是写个板子，写一下这个公式的具体实现，可以做 hdu 1724 Ellipse、haut oj 1261地狱飞龙 练下手具体代码：（代码中是求y=a*x+b在[L,R]上的积分）#include using namespace std;const double eps=1e-7;double a,b,l,r;int t;double F(double

题目链接：http://arc084.contest.atcoder.jp/tasks/arc084_bD - Small MultipleTime limit : 2sec / Memory limit : 256MBScore : 700 pointsProblem StatementFind the smallest possi