acm
文章平均质量分 79
真的好难
因为热爱,所以才一步一步走下去。。
展开
-
hdu 5636(最短路)
Shortest PathTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1178 Accepted Submission(s): 369Problem DescriptionThere i原创 2016-03-09 20:03:08 · 409 阅读 · 0 评论 -
hdu 5671(模拟)
MatrixTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 768 Accepted Submission(s): 323Problem DescriptionThere is a matr原创 2016-04-26 19:39:33 · 298 阅读 · 0 评论 -
hdu 5670
MachineTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 442 Accepted Submission(s): 263Problem DescriptionThere is a machi原创 2016-04-26 19:38:02 · 271 阅读 · 0 评论 -
hdu 5651 (组合数学 + 阶乘求逆元)
xiaoxin juju needs helpTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1149 Accepted Submission(s): 329Problem Description原创 2016-03-28 21:36:09 · 1324 阅读 · 0 评论 -
hdu 1575(矩阵快速幂)
Tr ATime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4088 Accepted Submission(s): 3050Problem DescriptionA为一个方阵,则Tr A表示A的迹原创 2016-04-12 14:44:09 · 241 阅读 · 0 评论 -
hiho 1270(dp)
题目:http://hihocoder.com/problemset/problem/1270//还是要静下心来好好想想,想通了再写。。。 乱交一点意义都没有//还是学长说的对:"提交简单,AC不易,且敲且叹息”。。。//这题是个完全背包不过稍有变形 完全背包求得是给你一个背包V问装满V可以取得最大值,此题是取得最小值。//不过需要注意题目要求可以溢出 就是物品的容量即使大于V也可原创 2016-03-14 16:28:30 · 315 阅读 · 0 评论 -
hiho 1269(二分)
题目:http://hihocoder.com/problemset/problem/1269//主要就是二分查找 以q 为界限#include using namespace std;long long n,m;int a[100005];priority_queueq;long long Find(int len){ while(!q.empty())原创 2016-03-14 16:21:42 · 317 阅读 · 0 评论 -
hdu 5656 dp
CA Loves GCDTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1212 Accepted Submission(s): 397Problem DescriptionCA is a原创 2016-04-05 19:35:21 · 329 阅读 · 0 评论 -
hdu 5365
LCP ArrayTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1223 Accepted Submission(s): 338Problem DescriptionPeter has a原创 2016-03-09 19:58:11 · 343 阅读 · 0 评论 -
hdu 3068(最长回文字符串)
最长回文Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13839 Accepted Submission(s): 5039Problem Description给出一个只由小写英文字符a,b,原创 2016-03-16 15:51:06 · 345 阅读 · 0 评论 -
hdu 5616(dp)
Jam's balanceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 733 Accepted Submission(s): 351Problem DescriptionJim has a bala原创 2016-03-01 20:02:32 · 396 阅读 · 0 评论 -
ecjtu 2015 ACM竞赛
http://acm.hdu.edu.cn/diy/contest_show.php?cid=288271001:排序求解#include #include #include #include #include using namespace std;double ff(double x1,double y1,double x2,double y2){ retur原创 2015-12-01 14:35:10 · 298 阅读 · 0 评论 -
hdu 5569(dp)
matrixTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 450 Accepted Submission(s): 270Problem DescriptionGiven a matrix wi原创 2015-11-26 19:44:51 · 326 阅读 · 0 评论 -
hdu 5567
sequence1Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 292 Accepted Submission(s): 218Problem DescriptionGiven an array原创 2015-11-26 19:42:49 · 455 阅读 · 0 评论 -
hdu 5596
GTW likes gtTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 316 Accepted Submission(s): 111Problem DescriptionLong long原创 2015-12-12 23:47:09 · 352 阅读 · 0 评论 -
hdu 5595
GTW likes mathTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 125 Accepted Submission(s): 76Problem DescriptionAfter原创 2015-12-12 23:42:57 · 338 阅读 · 0 评论 -
hdu 5672
StringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 939 Accepted Submission(s): 305Problem DescriptionThere is a string原创 2016-04-26 19:42:31 · 316 阅读 · 0 评论 -
hdu 2546(01背包)
饭卡Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19702 Accepted Submission(s): 6867Problem Description电子科大本部食堂的饭卡有一种很诡异的原创 2016-04-10 15:23:26 · 201 阅读 · 0 评论 -
hdu 2159(二维完全背包)
FATETime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11009 Accepted Submission(s): 5191Problem Description最近xhd正在玩一款叫做FATE原创 2016-04-10 15:49:33 · 203 阅读 · 0 评论 -
HDu 5361
In TouchTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1609 Accepted Submission(s): 435Problem DescriptionThere are n soda原创 2015-09-11 12:53:29 · 453 阅读 · 0 评论 -
cf 437 D(并查集)
链接:http://codeforces.com/problemset/problem/437/D 两个集合A,B的个数分别n,m,当着两个集合通过f(a,b)连通时f(a,b)是最小的边,题目结果为n*m*f(a,b)*2 所以可以将边从大到小排序之后,用并查集维护并计算个数#include using namespace std;#define ll long lo原创 2016-07-12 19:22:26 · 324 阅读 · 0 评论 -
cf 689 D(线段树+二分)
链接:http://codeforces.com/problemset/problem/689/D#include using namespace std;#define ll long longconst int maxn=2e5+10;struct tree{ int l,r; int a,b,ma,mi;}tree[3*maxn];int a[max原创 2016-07-12 19:27:47 · 335 阅读 · 0 评论 -
cf 102 A(暴力)
链接:http://codeforces.com/problemset/problem/102/A#include using namespace std;int a[105],ma[105][105];int main(){ int n,m; scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) sca原创 2016-07-12 19:25:33 · 280 阅读 · 0 评论 -
cf 337 D(dfs)
链接:http://codeforces.com/problemset/problem/337/D 找到已经被攻击的最远距离的两个点,再遍历其他点到这两点之间的距离,当两点之间的距离都小于d,这符合题意 #include using namespace std;const int maxn=1e5+5;int n,m,d;int a[maxn],dist1[maxn],dist原创 2016-07-12 19:06:23 · 1215 阅读 · 0 评论 -
cf 433 C(思维题)
链接:http://codeforces.com/problemset/problem/433/C 思路:可以先计算总的消耗,接着计算将某一类型的所有数字更换成相邻的数字之后所降低消耗的最大值。。可以枚举每一个数换成相邻的数字之后减低的消耗,正常枚举肯定会超时。所以需要我们先求出每一个相邻数字的前缀和,接着枚举一个可以用o(1)的时间算出降低的消耗,具体看代码#原创 2016-07-11 09:52:29 · 494 阅读 · 0 评论 -
cf 185A(矩阵快速幂)
A. Planttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDwarfs have planted a very interesting plant, whic原创 2016-05-19 21:07:32 · 637 阅读 · 0 评论 -
poj 3233(矩阵快速幂+二分)
Matrix Power SeriesTime Limit: 3000MS Memory Limit: 131072KTotal Submissions: 19323 Accepted: 8152DescriptionGiven a n × n matrix A and a positive integer k, fi原创 2016-04-15 19:50:56 · 314 阅读 · 0 评论 -
poj 3070(矩阵快速幂)
FibonacciTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12213 Accepted: 8668DescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn原创 2016-04-14 19:14:18 · 273 阅读 · 0 评论 -
hdu 2157(矩阵快速幂)
How many ways??Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2353 Accepted Submission(s): 891Problem Description春天到了, H原创 2016-04-14 19:12:19 · 262 阅读 · 0 评论 -
poj 3260(多重+完全背包)
The Fewest CoinsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6030 Accepted: 1807DescriptionFarmer John has gone to town to buy some farm supplies. Be原创 2016-04-10 16:27:55 · 521 阅读 · 0 评论 -
poj 1742(多重背包)
CoinsTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 33224 Accepted: 11279DescriptionPeople in Silverland use coins.They have coins of value A1,A2,A3...原创 2016-04-10 16:21:13 · 256 阅读 · 0 评论 -
poj 1014(多重背包)
DividingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 66477 Accepted: 17291DescriptionMarsha and Bill own a collection of marbles. They want to split原创 2016-04-10 16:17:06 · 236 阅读 · 0 评论 -
poj 1252(完全背包)
Euro EfficiencyTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3712 Accepted: 1582DescriptionOn January 1st 2002, The Netherlands, and several other Eur原创 2016-04-10 16:14:14 · 349 阅读 · 0 评论 -
poj 3624(01背包)
Charm BraceletTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 31347 Accepted: 13942DescriptionBessie has gone to the mall's jewelry store and spies a ch原创 2016-04-10 16:10:03 · 282 阅读 · 0 评论 -
HDU 5500
Reorder the BooksTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 449 Accepted Submission(s): 294Problem Descriptiondxy原创 2015-10-14 16:06:24 · 350 阅读 · 0 评论 -
HDU 5461
Largest PointTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 973 Accepted Submission(s): 386Problem DescriptionGiven the原创 2015-09-23 13:26:24 · 372 阅读 · 0 评论 -
HDU 5455(字符串)
Fang FangTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 849 Accepted Submission(s): 350Problem DescriptionFang Fang says原创 2015-09-23 13:24:37 · 429 阅读 · 0 评论 -
hihoCoder (1223 : 不等式)
链接:http://hihocoder.com/problemset/problem/1223#include #include #include #include #include using namespace std;char s[1010][100];int a[100];int main(){ int n; while(~scanf("%d原创 2015-08-31 16:39:16 · 843 阅读 · 0 评论 -
hihoCoder 1224 : 赛车
链接:http://hihocoder.com/problemset/problem/1224//深搜一遍求最大深度,从最大深度的叶子回溯到根的所经过的每个顶点在深搜求最大深度#include #include #include #include #include #include using namespace std;const int maxn=100000+10;原创 2015-08-31 16:43:27 · 528 阅读 · 0 评论 -
hdu 5327
OlympiadTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 564 Accepted Submission(s): 406Problem DescriptionYou are one of the comp原创 2015-08-03 18:07:22 · 448 阅读 · 0 评论