HDU刷题
文章平均质量分 63
Jay_fearless
这个作者很懒,什么都没留下…
展开
-
东华oj 80道(61~80题)
东华大学oj 61~80题原创 2022-03-27 21:46:47 · 431 阅读 · 0 评论 -
东华oj 80道(41~60题)
41.联系#include<bits/stdc++.h>using namespace std;int n,m,r,ans,a,b,T;string s,ss;map<string,int> mp;bool cmp(string a,string b){ if(a.size()!=b.size()) return a.size()<b.size(); return a<b;}int main(){ cin>>a>>b>原创 2022-03-26 09:20:55 · 222 阅读 · 0 评论 -
东华oj 80道(1~40题)
东华oj 80道1~40题解析原创 2022-03-24 22:50:23 · 1559 阅读 · 0 评论 -
洛谷P2516 [HAOI2010]最长公共子序列 动态规划
分析给出两个字符A和B,求A和B最长公共子序列长度以及最长的长度个数有几个。###1. 首先求最长公共子序列最长公共子序列问题:###2. 求出了最长的长度,之后要同时把长度的数目计算清楚。用cnt[i][j]表示A前i位,B前j位的最长公共子序列数目。对于每个f[i][j]:1. 若f[i][j]==f[i-1][j],说明状态是从f[i-1][j]转移来的,cnt[i][j]要加上cnt[i-1][j]2. 若f[i][j]==f[i][j-1],说明状态是从f[i][j-1]转移来的原创 2021-02-22 16:58:51 · 208 阅读 · 0 评论 -
HDU1147 Pick-up sticks (线段相交)
题目描述Stan has n sticks of various length. He throws them one at a time on the floor in a random way. After finishing throwing, Stan tries to find the top sticks, that is these sticks such that there is no stick on top of them. Stan has noticed that the las原创 2021-02-09 21:50:05 · 162 阅读 · 0 评论 -
Wall (Graham扫描求凸包)
题目描述Once upon a time there was a greedy King who ordered his chief Architect to build a wall around the King’s castle. The King was so greedy, that he would not listen to his Architect’s proposals to build a beautiful brick wall with a perfect shape and n原创 2021-02-09 20:38:21 · 88 阅读 · 0 评论 -
You can Solve a Geometry Problem too (判断线段相交)
题目描述Many geometry(几何)problems were designed in the ACM/ICPC. And now, I also prepare a geometry problem for this final exam. According to the experience of many ACMers, geometry problems are always much trouble, but this problem is very easy, after all we原创 2021-02-09 16:40:49 · 150 阅读 · 0 评论 -
HDU.1072 Nightmare(可重复走bfs)
题目描述Ignatius had a nightmare last night. He found himself in a labyrinth with a time bomb on him. The labyrinth has an exit, Ignatius should get out of the labyrinth before the bomb explodes. The initial exploding time of the bomb is set to 6 minutes. To原创 2021-02-01 21:14:28 · 83 阅读 · 0 评论 -
HDU1171 Big Event in HDU(多重背包)
题目描述Nowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don’t know that Computer College had ever been split into Computer College and Software College in 2002.The splitting is absolutely a big event in HDU! At th原创 2021-02-01 08:04:36 · 131 阅读 · 0 评论 -
HDU 1203 (0-1背包求浮点数最小)
题目描述Speakless很早就想出国,现在他已经考完了所有需要的考试,准备了所有要准备的材料,于是,便需要去申请学校了。要申请国外的任何大学,你都要交纳一定的申请费用,这可是很惊人的。Speakless没有多少钱,总共只攒了n万美元。他将在m个学校中选择若干的(当然要在他的经济承受范围内)。每个学校都有不同的申请费用a(万美元),并且Speakless估计了他得到这个学校offer的可能性b。不同学校之间是否得到offer不会互相影响。“I NEED A OFFER”,他大叫一声。帮帮这个可怜的人吧,帮原创 2021-01-31 23:03:39 · 167 阅读 · 0 评论