随笔分类 -  贪心

摘要:View Code1#include<iostream>2#include<cstdio>3#include<algorithm>4usingnamespacestd;5intarr[3100];6intcmp(intx,inty)7{8returnx<y;9}10intmain()11{12intn;13while(scanf("%d",&n)!=EOF)14{15for(inti=1;i<=n;i++)16scanf("%d",&arr[i]);17sort(arr+1,arr+1+n, 阅读全文
posted @ 2012-05-16 09:54 wconvey 阅读(104) 评论(0) 推荐(0)
摘要:View Code1#include<iostream>2#include<cstdio>3#include<algorithm>4usingnamespacestd;5intcmp(intx,inty)6{7returnx<y;8}9intmain()10{11intC,arr[110];12scanf("%d",&C);13while(C--)14{15intn,v,w;16scanf("%d%d%d",&n,&v,&w);17for(inti=1;i<=n;i++)18 阅读全文
posted @ 2012-05-16 09:17 wconvey 阅读(142) 评论(0) 推荐(0)
摘要:View Code1#include<iostream>2#include<cstdio>3#include<algorithm>4usingnamespacestd;5structnode6{7intp,h;8}arr[1100];9intcmp(nodex,nodey)10{11returnx.p<y.p;12}13intmain()14{15intC;16scanf("%d",&C);17while(C--)18{19intn,m;20scanf("%d%d",&n,&m);21fo 阅读全文
posted @ 2012-05-15 13:43 wconvey 阅读(155) 评论(0) 推荐(0)
摘要:View Code1#include<iostream>2#include<cstdio>3#include<algorithm>4usingnamespacestd;5structnode6{7intp,m;8}arr[110];9intcmp(nodex,nodey)10{11returnx.p>y.p;12}13intmain()14{15intv,n;16while(scanf("%d",&v)!=EOF)17{18if(v==0)19break;20scanf("%d",&n);21fo 阅读全文
posted @ 2012-05-14 21:56 wconvey 阅读(114) 评论(0) 推荐(0)
摘要:View Code1#include<iostream>2#include<cstdio>3#include<algorithm>4usingnamespacestd;5structnode6{7intl,w;8}arr[5100];9intvis[5100];10intcmp(nodex,nodey)11{12if(x.l==y.l)13returnx.w<y.w;14else15returnx.l<y.l;16}17intmain()18{19intt,n;20scanf("%d",&t);21while(t--) 阅读全文
posted @ 2012-05-14 20:48 wconvey 阅读(176) 评论(0) 推荐(0)
摘要:View Code1#include<iostream>2#include<cstdio>3#include<math.h>4usingnamespacestd;5intmain()6{7intn,u,d;8while(cin>>n>>u>>d)9{10if(n+u+d==0)11break;12intans=(int)(ceil((n-u)*1.0/(u-d)))*2+1;13printf("%d\n",ans);14}15return0;16 阅读全文
posted @ 2012-05-14 19:47 wconvey 阅读(101) 评论(0) 推荐(0)