- 博客(20)
- 收藏
- 关注
RSS订阅原创 HDU 5469(Antonidas-树上匹配字符串)
在一个树上(1≤N≤104)(1≤N≤10^4)匹配字符串直接暴力树dp用map存， 时间可卡过，记得递归后清map防止MLE#include<cstdio>#include<cstring>#include<cstdlib>#include<algorithm>#include<functional>#include<iostream>#include<cmath>#include
2015-09-28 21:27:43
1076
原创 HDU 5486(Difference of Clustering-聚类)
Difference of Clustering给定10^6个关系 现在要求从左到右1对多，多对1，1:1的情况的数量 但是n:n的情况要排除 直接离散，求连通块#include<bits/stdc++.h>using namespace std;#define For(i,n) for(int i=1;i<=n;i++)#define Fork(i,k,n) for(int i=k
2015-09-27 22:17:30
1079
原创 HDU 5492(Find a path-最小方差路径)
Find a path在矩阵中，找一条到从(1,1)到(n,m)（只能向上，右走）的路径，使路径上方差最小。对于S=∑N1(ai−x¯)2<∑N1(ai−x)2(x≠x¯) S=\sum_1^N(ai-\overline x)^2 <\sum_1^N(ai-x)^2 (x\neq \overline x) 而本题x¯范围很小\overline x 范围很小，暴力枚举即可#include<cstd
2015-09-27 22:01:46
1640
原创 HDU 5458(Stability-LCT维护连通图2点间割边个数)
Stability给定一张无向连通图，维护2个操作，删一条边（删后保证连通），求2点间有多少条边，只要删除2点就不连通。Input There are multiple test cases(no more than 3 cases), and the first line contains an integer t, meaning the totally number of test case
2015-09-23 22:24:39
1066
原创 BZOJ 1607([Usaco2008 Dec]Patting Heads 轻拍牛头-线性筛)
1607: [Usaco2008 Dec]Patting Heads 轻拍牛头Time Limit: 3 Sec Memory Limit: 64 MBSubmit: 1152 Solved: 601[Submit][Status][Discuss]Description 今天是贝茜的生日，为了庆祝自己的生日，贝茜邀你来玩一个游戏． 贝茜让N(1≤N≤100
2015-09-11 01:23:28
719
原创 BZOJ 2960(跨平面-平面图转对偶图求最小有向图)
2960: 跨平面Time Limit: 1 Sec Memory Limit: 256 MBSubmit: 157 Solved: 65[Submit][Status][Discuss]DescriptionInput 第一行两个整数n和m，表示点与线段的数目。 接下来n行，每行两个整数x和y，表示第i个点的坐标，点从1到n编号。 接下来m
2015-09-11 01:19:41
905
原创 HDU 4960(Another OCD Patient-区间dp)
Another OCD Patient Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1320 Accepted Submission(s): 459Problem Description 已知一个数列，现在把它分成k段，
2015-09-06 16:57:06
755
原创 HDU 4967(Handling the Past-线段树维护可持久化栈操作)
Handling the PastTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 450 Accepted Submission(s): 188Problem DescriptionNowadays, cl
2015-09-06 16:52:00
1069
原创 HDU 4966(GGS-DDU-最小树形图)[Template:最小树形图]
GGS-DDUTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 588 Accepted Submission(s): 285Problem DescriptionDo you think this is a
2015-09-06 16:44:18
1012
原创 HDU 4913(Least common multiple-线段树+容斥)
Least common multipleTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 767 Accepted Submission(s): 257Problem Descriptionbobo has
2015-09-05 13:11:20
789
原创 HDU 1402(A * B Problem Plus-FFT速度测试)
A * B Problem PlusTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15111 Accepted Submission(s): 2942Problem DescriptionCalculate
2015-09-04 11:25:29
597
原创 HDU 4912(Paths on the tree-树上取链，贪心)
Paths on the treeTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1161 Accepted Submission(s): 384Problem Descriptionbobo has a
2015-09-04 10:27:58
882
原创 HDU 4919(Exclusive or-java的HashMap类)
Exclusive orTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 695 Accepted Submission(s): 277Problem DescriptionGiven n, find the
2015-09-03 20:31:21
730
原创 HDU 4920(Matrix multiplication-矩阵乘法优化)
Matrix multiplicationTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 3647 Accepted Submission(s): 1522Problem DescriptionGiven
2015-09-03 20:29:05
744
原创 HDU 4916(Count on the path-树上除链上的节点外最小值[强制在线])
Count on the pathTime Limit: 5000/2500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 866 Accepted Submission(s): 219Problem Descriptionbobo has a t
2015-09-03 20:24:19
1150
原创 HDU 4609(3-idiots-FFT+dp)
3-idiotsTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3109 Accepted Submission(s): 1072Problem DescriptionKing OMeGa catched t
2015-09-03 11:22:40
811
原创 BZOJ 1258([CQOI2007]三角形tri-模拟)
1258: [CQOI2007]三角形triTime Limit: 5 Sec Memory Limit: 162 MBSubmit: 287 Solved: 165[Submit][Status][Discuss]Description画一个等边三角形，把三边的中点连接起来，得到四个三角形，把它们称为T1,T2,T3,T4，如图1。把前三个三角形也这样划分，得到12个
2015-09-02 20:58:09
855
原创 BZOJ 2194(快速傅立叶之二-FFT)
2194: 快速傅立叶之二Time Limit: 10 Sec Memory Limit: 259 MB Description请计算C[k]=sigma(a[i]*b[i-k]) 其中 k < = i < n ，并且有 n < = 10 ^ 5。 a,b中的元素均为小于等于100的非负整数。Input 第一行一个整数N,接下来N行，第i+2..i+N-1行，每行两个数，依次表示a[i],b
2015-09-02 20:02:08
824
原创 BZOJ 2179(FFT快速傅立叶-FFT)
2179: FFT快速傅立叶Time Limit: 10 Sec Memory Limit: 259 MBSubmit: 1899 Solved: 944[Submit][Status][Discuss]Description给出两个n位10进制整数x和y，你需要计算x*y。Input第一行一个正整数n。 第二行描述一个位数为n的正整数x。 第三行描述一个位
2015-09-02 16:46:44
800
原创 HDU 4893(Wow! Such Sequence!-线段树单点修改+区间求和+改为最近Fib数)
Wow! Such Sequence!Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3830 Accepted Submission(s): 1081Problem DescriptionRecently,
2015-09-01 21:07:37
825
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人