![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM
classic_YZ
这个作者很懒,什么都没留下…
展开
-
poj 2192 Zipper (DP)
#include #include #include #include #include #include #include #include #include #include #define LL long longint dp[1001][1001];char str1[1001],str2[1001],str3[1001];int main(){ //freo原创 2014-12-20 13:40:08 · 270 阅读 · 0 评论 -
PAT 1080Graduate Admission
#include #include#include#include#includeusing namespace std;struct student{ int ge,gi,sum,id; int adm[5];}st[40100];struct school{int count;vector ad;}sc[110];vectors[110];int cmp(con原创 2015-03-05 19:25:47 · 282 阅读 · 0 评论 -
PAT 1007. Maximum Subsequence Sum
#include#include#include#include#includeusing namespace std;int n;int num[10010];int main(){ //freopen("G://test.txt","r",stdin); while(scanf("%d",&n)!=EOF){ for(int i=0;i<n;++i){ scanf原创 2015-03-10 18:16:58 · 328 阅读 · 0 评论 -
ZOJ 3870 Team Formation(浙江省第12届ACM省赛第二题)
ZOJ 3870 Team Formation(浙江省第12届ACM省赛第二题)For an upcoming programming contest, Edward, the headmaster of Marjar University, is forming a two-man team fromN students of his university.Edward knows the skill level of each student. He has fo原创 2015-04-26 14:05:01 · 790 阅读 · 0 评论 -
优先队列
#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;struct node{ friend bool operator { return n1.p转载 2015-07-03 10:31:03 · 266 阅读 · 0 评论 -
ACM的资料(1)
(1)map的使用(Uva508)#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int maxn=9999999; mapchar, string> morse; ma原创 2015-07-03 10:26:14 · 362 阅读 · 0 评论 -
HDU 1024 Max Sum Plus Plus(DP,)
给m,n,然后n个数,分成互不相交的m段,问各段相加最大值。#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define MAXN 1000010#define INF 0x7fffffffint原创 2015-07-28 09:42:54 · 843 阅读 · 0 评论 -
HDU 1069 Monkey and Banana(DP)
就是找最高递减子序列。排下序就好。#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define INF 0x7fffffffstruct node{int x,y,z;}num[333];int原创 2015-07-28 09:44:44 · 347 阅读 · 0 评论 -
2015 Multi-University Training Contest 3 1002 RGCDQ(hdu5317)
#include#include#include#include#include#include#include#include#include#include#includeusing namespace std; #define INF 0x7fffffff//vector f;int f[100000];int countt;bool num[1000010原创 2015-07-29 09:36:31 · 238 阅读 · 0 评论 -
hdu 5316Magician (线段树)
MagicianTime Limit: 18000/9000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1067 Accepted Submission(s): 283Problem DescriptionFantasy magicians原创 2015-07-29 11:44:03 · 680 阅读 · 1 评论 -
PAT 1082
#include #include#include#include#includeusing namespace std;vector shu;int main(){// freopen("G://test.txt","r",stdin); char n[15]; char *s; char num[11][8]={"ling","yi","er","san","si","原创 2015-03-04 20:24:21 · 409 阅读 · 0 评论 -
PAT 1002. A+B for Polynomials
#include #include #include #include #include #include #include #include #include #include #include using namespace std;struct p{int ni;double ani;} num[1010];int main(){ //freopen("原创 2015-02-27 14:10:53 · 231 阅读 · 0 评论 -
PAT 1001 A+B Format
#include #include #include #include #include #include #include #include #include #include #include using namespace std;int main(){ //freopen("G://test.txt","r",stdin); int a,b,sum,v原创 2015-02-27 14:10:21 · 317 阅读 · 0 评论 -
HDU 5135 Little Zu Chongzhi's Triangles(状态压缩)
#include#include#include#include#include#includeusing namespace std;struct p{int x;int y;int z;double S;}point[232];double dian[15];int c;double dp[10000];double mianji(int a,int b,i原创 2014-12-04 16:58:38 · 369 阅读 · 0 评论 -
HDU5124 lines(离散)
#include#include#include#include#include#include#includeusing namespace std;#define MAXN 100mapa,b;int main(){ //freopen("G://test.txt","r",stdin); int t,i,j,k,n,temp1,temp2; sca原创 2014-12-20 14:16:11 · 306 阅读 · 0 评论 -
HDU5170 GTY's math problem
这题主要是注意精度...方法一:#include#include#include#include#includeusing namespace std;#define jd 1e-12 int main(){ //freopen("G://test.txt","r",stdin); double a,b,c,d; while(scanf("%lf%l原创 2015-02-08 11:09:42 · 441 阅读 · 0 评论 -
489F. Special Matrices(dp)
dp[i][j][k]表示第i行状态,有j个还需要2个1,有k个爱需要1个1,但是因为空间需求太大,所以使用滚动数组。#include#include#include#include#include#includeusing namespace std;__int64 dp[2][505][505];int main(){ //freopen("G://test.txt","原创 2015-01-23 10:31:10 · 366 阅读 · 0 评论 -
HDU 5155 Harry And Magic Box --DP
#include #include #include #include #include #include #define Mod 1000000007#define lll __int64using namespace std;lll c[55][55];lll dp[55][55];void calc(){ for(int i=0;i<=51;i++)转载 2015-01-23 19:43:24 · 370 阅读 · 0 评论 -
PAT 1009. Product of Polynomials
#include #include #include #include #include #include #include #include #include #include #include using namespace std;struct p{int ni;double ani;} a[15],b[15],c[2020];int main(){ //原创 2015-02-27 15:01:59 · 353 阅读 · 0 评论 -
HDU5159 Card
CardTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 429 Accepted Submission(s): 163Special JudgeProblem DescriptionThere are x c原创 2015-01-24 11:13:09 · 461 阅读 · 0 评论 -
HDU5163Taking Bus(水题)
用画图工具画画线段就能明显看出来#include#include#include#include#include#includeusing namespace std;__int64 shu[100010];int main(){ // freopen("G://test.txt","r",stdin); int t; int n,m; scan原创 2015-01-25 09:03:39 · 494 阅读 · 0 评论 -
PAT 1003. Emergency
#include #include #include #include #include #include #include #include #include #include #include using namespace std;int num[505][505],vit[505]; int helper[505];vector ljb[505]; int原创 2015-02-27 14:11:40 · 297 阅读 · 0 评论 -
POJ 1661 Help Jimmy(DP,注意边界)
Help JimmyTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9399 Accepted: 3025Description"Help Jimmy" 是在下图所示的场景上完成的游戏。 场景中包括多个长度和高度各不相同的平台。地面是最低的平台原创 2015-08-01 11:20:43 · 688 阅读 · 0 评论