<模板题>
文章平均质量分 83
KeyboardPianist
这个作者很懒,什么都没留下…
展开
-
HDU 1556 Color the ball 线段树模板题
#include #define ll long long #define lson l, m, rt<<1 #define rson m + 1, r, rt<<1|1 #define root 1, N, 1 const int maxn = 100005; ll add[maxn<<2]; ll sum[maxn<<2]; void pushUp(int rt){ sum[rt]原创 2015-10-26 22:23:11 · 455 阅读 · 0 评论 -
HDU 1754 I Hate It
线段树单点更新和求最大值 #include #define lson l, m, rt<<1 #define rson m + 1, r, rt<<1|1 const int maxn = 200005; int MAX[maxn<<2]; int max(int a, int b) {return a>b?a:b;} void pushUp(int rt){ MAX[rt] = ma原创 2015-10-30 01:50:49 · 328 阅读 · 0 评论 -
HDU2604 Queuing(矩阵快速幂模板)
Queuing Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4348 Accepted Submission(s): 1925 Problem Description Queues and Priority Q原创 2016-05-21 10:04:19 · 573 阅读 · 0 评论 -
大数模板
大数乘法: #include #include using namespace std; void multiply(const char *a,const char *b); int main() { //cout<<"hicjiajia"<<endl; string num1,num2; // 初始状态用string来存储大数 cout转载 2016-05-22 21:56:30 · 347 阅读 · 0 评论 -
POJ2914 Minimum Cut(最小割模板题)
Minimum Cut Time Limit: 10000MS Memory Limit: 65536K Total Submissions: 9122 Accepted: 3820 Case Time Limit: 5000MS Description Given an undirected graph, in whi原创 2016-09-19 16:31:53 · 1306 阅读 · 0 评论 -
HDU2874 Connections between cities(tarjan-lca)
Connections between cities Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 10005 Accepted Submission(s): 2400 Problem Description原创 2016-11-03 20:59:02 · 440 阅读 · 0 评论 -
POJ1459 Power Network(网络流)
Power Network Time Limit: 2000MS Memory Limit: 32768K Total Submissions: 27409 Accepted: 14256 Description A power network consists of nodes (power stations, consumers原创 2016-10-15 10:05:58 · 443 阅读 · 0 评论 -
HDU1269 迷宫城堡(强连通分量tarjan入门题)
迷宫城堡 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 13402 Accepted Submission(s): 5966 Problem Description 为了训练小希的方向感,Gardon建立了一座原创 2016-11-02 10:10:16 · 543 阅读 · 0 评论