摘要:
2015.12.12 bestcoder的一道数位dp: http://bestcoder.hdu.edu.cn/contests/contest_chineseproblem.php?cid=659&pid=1003 2015.12.20 codeforces的两道没看懂题意的题 http://c 阅读全文
posted @ 2015-12-12 23:10
__560
阅读(218)
评论(0)
推荐(0)
摘要:
1002:这题拿两个优先队列维护一下就可以了,近期都在做这种题,然而这题居然还是不会,why am i so stupid...#include#define REP(i,a,b) for(int i=a;i>T; while(T--){ scanf("%d%d",&n,&m);... 阅读全文
posted @ 2015-12-12 22:24
__560
阅读(219)
评论(0)
推荐(0)
摘要:
#include#define REP(i,a,b) for(int i=a;i>T;int casen=1; while(T--){ scanf("%d",&n); REP(i,0,n-1) scanf("%lld",&p[i]); REP(i,0,... 阅读全文
posted @ 2015-12-12 18:45
__560
阅读(253)
评论(0)
推荐(0)
摘要:
#include#define REP(i,a,b) for(int i=a;i=(1LL>T;int casen=1; s[0]=1;REP(i,1,32) s[i]=s[i-1]*3; while(T--){ scanf("%lld%lld%lld",&k,&a,&b)... 阅读全文
posted @ 2015-12-12 17:39
__560
阅读(214)
评论(0)
推荐(0)
摘要:
#include#define REP(i,a,b) for(int i=a;i=1;i--){ s+=a[i]; if(s>m){ s=a[i]; tmp[i]=1; cnt++; } ... 阅读全文
posted @ 2015-12-12 15:32
__560
阅读(377)
评论(0)
推荐(0)
摘要:
#include#define REP(i,a,b) for(int i=a;i>T; while(T--){ scanf("%d%d",&n,&L); REP(i,1,n) scanf("%1d",&a[i]); s[0]=0;REP(i,1,n) ... 阅读全文
posted @ 2015-12-12 15:06
__560
阅读(264)
评论(0)
推荐(0)