09 2019 档案

you_are_the_one(区间dp)
摘要：You Are the One Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6711 Accepted Submission(s): 3341 阅读全文
posted @ 2019-09-27 19:52 Cruel_King 阅读(287) 评论(2) 推荐(0)
2014年北京 happy matt friends(dp + 滚动数组优化)
摘要：Happy Matt Friends Time Limit: 6000/6000 MS (Java/Others) Memory Limit: 510000/510000 K (Java/Others)Total Submission(s): 6164 Accepted Submission(s): 阅读全文
posted @ 2019-09-27 17:18 Cruel_King 阅读(213) 评论(0) 推荐(0)
multiplication_puzzle(区间dp)
摘要：You Are the One Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6706 Accepted Submission(s): 3339 阅读全文
posted @ 2019-09-26 18:11 Cruel_King 阅读(272) 评论(0) 推荐(0)
Almost Sorted Array(o(nlgn)求解LIS)
摘要：Almost Sorted Array Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 10562 Accepted Submission(s 阅读全文
posted @ 2019-09-25 18:18 Cruel_King 阅读(226) 评论(0) 推荐(0)
computer(树形dp || 树的直径)
摘要：Computer Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 38417 Accepted Submission(s): 6957 Probl 阅读全文
posted @ 2019-09-24 11:53 Cruel_King 阅读(243) 评论(0) 推荐(0)
cell_phone_network(树形dp求最小支配集)
摘要：Cell Phone Network Farmer John has decided to give each of his cows a cell phone in hopes to encourage their social interaction. This, however, requir 阅读全文
posted @ 2019-09-23 14:07 Cruel_King 阅读(180) 评论(0) 推荐(0)
tree_cuttting(树形dp求解树的重心)
摘要：Tree Cutting After Farmer John realized that Bessie had installed a "tree-shaped" network among his N (1 <= N <= 10,000) barns at an incredible cost, 阅读全文
posted @ 2019-09-23 10:03 Cruel_King 阅读(303) 评论(0) 推荐(0)
2015沈阳区域赛Meeting(最短路 + 建图)
摘要：Meeting Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 6865 Accepted Submission(s): 2085 Prob 阅读全文
posted @ 2019-09-21 13:40 Cruel_King 阅读(211) 评论(0) 推荐(0)
make the fence great again(dp 二维)
摘要：D. Make The Fence Great Again time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You have a 阅读全文
posted @ 2019-09-20 14:17 Cruel_King 阅读(823) 评论(0) 推荐(1)
2017沈阳区域赛Infinite Fraction Path(BFS + 剪枝)
摘要：Infinite Fraction Path Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 5756 Accepted Submission 阅读全文
posted @ 2019-09-18 17:51 Cruel_King 阅读(246) 评论(0) 推荐(0)
bitset详解
摘要：原文链接 阅读全文
posted @ 2019-09-18 15:56 Cruel_King 阅读(232) 评论(0) 推荐(0)
2016青岛区域赛.Coding Contest(费用流 + 概率计算转换为加法计算)
摘要：Coding Contest Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 5968 Accepted Submission(s): 1413 阅读全文
posted @ 2019-09-18 13:32 Cruel_King 阅读(247) 评论(0) 推荐(0)
2019上海网络赛B题(差分 + 离散化 or 差分 + 思维)
摘要：这题.....队里都没怎么训练差分,导致败北...写了一堆线段树嘤嘤嘤,到最后也是超时,比赛结束后看到了差分的思想于是就去学了一手. 其实了解差分思想的一眼就能看出来是差分了.但是如果对n差分的话很明显会T呢,所以我们考虑从m组询问入手. 要不我先讲一下我目前了解的差分吧. 直白说的话,差分就是用一 阅读全文
posted @ 2019-09-16 17:18 Cruel_King 阅读(258) 评论(0) 推荐(0)
poj-1664.放苹果.(递推)
摘要：放苹果 Description 把M个同样的苹果放在N个同样的盘子里，允许有的盘子空着不放，问共有多少种不同的分法？（用K表示）5，1，1和1，5，1 是同一种分法。 Input 第一行是测试数据的数目t（0 <= t <= 20）。以下每行均包含二个整数M和N，以空格分开。1<=M，N<=10。 阅读全文
posted @ 2019-09-09 20:52 Cruel_King 阅读(318) 评论(0) 推荐(0)
hdu-4738.Caocao's Bridges(图中权值最小的桥)
摘要：Caocao's Bridges Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10933 Accepted Submission(s): 30 阅读全文
posted @ 2019-09-07 23:21 Cruel_King 阅读(587) 评论(0) 推荐(0)
uva-315.network(连通图的割点)
摘要：本题大意:求一个无向图额割点的个数. 本题思路:建图之后打一遍模板. 阅读全文
posted @ 2019-09-06 17:43 Cruel_King 阅读(195) 评论(0) 推荐(0)
uva-796.critical links(连通图的桥)
摘要：本题大意:求出一个无向图的桥的个数并且按照顺序输出所有桥. 本题思路:注意判重就行了,就是一个桥的裸题. 判重思路目前知道的有两种,第一种是哈希判重,第二种和邻接矩阵的优化一样,就是只存图的上半角或者下半角. 参考代码: 阅读全文
posted @ 2019-09-06 16:57 Cruel_King 阅读(224) 评论(0) 推荐(0)
poj-1236.network of schools(强连通分量 + 图的入度出度)
摘要：Network of Schools Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 27121 Accepted: 10704 Description A number of schools are connected to a 阅读全文
posted @ 2019-09-04 21:53 Cruel_King 阅读(217) 评论(0) 推荐(0)
hdu-2255.奔小康赚大钱(最大权二分匹配)
摘要：奔小康赚大钱 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17652 Accepted Submission(s): 7436 Problem 阅读全文
posted @ 2019-09-04 00:14 Cruel_King 阅读(180) 评论(0) 推荐(0)
poj-2289.jamies contact groups(二分答案 + 二分多重匹配)
摘要：Jamie's Contact Groups Time Limit: 7000MS Memory Limit: 65536K Total Submissions: 9227 Accepted: 3180 Description Jamie is a very popular girl and has 阅读全文
posted @ 2019-09-03 23:54 Cruel_King 阅读(324) 评论(0) 推荐(0)
hdu-4185.loiol_skimming(简单二分匹配模型)
摘要：1 /************************************************************************* 2 > File Name: hdu-4185.oil_skimming.cpp 3 > Author: CruelKing 4 > Mail: 2016586625@qq.com 5 > C... 阅读全文
posted @ 2019-09-03 15:53 Cruel_King 阅读(230) 评论(0) 推荐(0)
hdu-2389.rain on your parade(二分匹配HK算法)
摘要：Rain on your Parade Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 655350/165535 K (Java/Others)Total Submission(s): 6752 Accepted Submission(s) 阅读全文
posted @ 2019-09-03 09:06 Cruel_King 阅读(292) 评论(0) 推荐(0)
hdu-2819.swap(二分匹配 + 矩阵的秩基本定理)
摘要：Swap Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5728 Accepted Submission(s): 2157Special Jud 阅读全文
posted @ 2019-09-02 21:29 Cruel_King 阅读(273) 评论(0) 推荐(0)