C++博客-Climber.pI的OI之路-最新评论http://www.cppblog.com/Climber-pI/CommentsRSS.aspxThrough the darkest dark，may we see the light.zh-cnThu, 10 Jan 2013 09:44:21 GMTThu, 10 Jan 2013 09:44:21 GMTcnblogsre: NOIP2012 纪中行记http://www.cppblog.com/Climber-pI/archive/2012/11/24/195097.html#195640Climber.pIClimber.pISat, 24 Nov 2012 13:18:00 GMThttp://www.cppblog.com/Climber-pI/archive/2012/11/24/195097.html#195640少年你认为我是 北京师范大学附属中学南山分校 的学生么 = =?
T_T 明明是深圳某校的某弱菜...

Climber.pI 2012-11-24 21:18 发表评论
]]>re: NOIP2012 纪中行记http://www.cppblog.com/Climber-pI/archive/2012/11/24/195097.html#195636zoushihuanzoushihuanSat, 24 Nov 2012 12:27:00 GMThttp://www.cppblog.com/Climber-pI/archive/2012/11/24/195097.html#195636I'm chusan。who are you？

zoushihuan 2012-11-24 20:27 发表评论
]]>re: NOIp 2005 过河http://www.cppblog.com/Climber-pI/archive/2011/09/08/129084.html#155350PZYRPZYRThu, 08 Sep 2011 05:30:00 GMThttp://www.cppblog.com/Climber-pI/archive/2011/09/08/129084.html#155350#include<iostream>
using namespace std;
#define MAXN 1000000;
bool L[200000] = {0};
int f[200000] = {0}, stone[110] = {0};
int min(int x, int y){return x < y ? x : y;}
void swap(int x, int y){
int k = stone[x];
stone[x] = stone[y];
stone[y] = k;
}
int main(){
int l, S, T, M, i, j;
scanf("%d%d%d%d", &l, &S, &T, &M);
for (i = 1; i <= M; i++) scanf("%d", &stone[i]);
stone[0] = 0;
for (i = 1; i < M; i++)
for (j = i+1; j <= M; j++)
if (stone[i] > stone[j]) swap(i, j);
stone[++M] = l;
for (i = 1; i <= M; i++){
while (stone[i] - stone[i-1] > 2520) stone[i] -= 2520;
if (i != M) L[stone[i]] = 1;
}
l = stone[M--];
for (i = 0; i <= l; i++) f[i] = MAXN; f[0] = 0;
for (i = 0; i < l; i++)
for (j = S; j <= T; j++){
int k = i+j;
if (i + j >= l) k = l;
f[k] = min(f[k], f[i]+L[i]);
}
printf("%d\n", f[l]);
}

PZYR 2011-09-08 13:30 发表评论
]]>re: Dp札记[未登录]http://www.cppblog.com/Climber-pI/archive/2011/05/18/128437.html#146688Climber.pIClimber.pIWed, 18 May 2011 11:14:00 GMThttp://www.cppblog.com/Climber-pI/archive/2011/05/18/128437.html#146688

Climber.pI 2011-05-18 19:14 发表评论
]]>re: Prepare NOIp 2010 Final Planhttp://www.cppblog.com/Climber-pI/archive/2010/11/19/131056.html#134101AhaAhaFri, 19 Nov 2010 10:04:00 GMThttp://www.cppblog.com/Climber-pI/archive/2010/11/19/131056.html#134101

Aha 2010-11-19 18:04 发表评论
]]>re: Prepare NOIp 2010 Final Planhttp://www.cppblog.com/Climber-pI/archive/2010/10/25/131056.html#131232Climber.pIClimber.pIMon, 25 Oct 2010 13:55:00 GMThttp://www.cppblog.com/Climber-pI/archive/2010/10/25/131056.html#131232拿来热身 - -

Climber.pI 2010-10-25 21:55 发表评论
]]>re: Prepare NOIp 2010 Final Planhttp://www.cppblog.com/Climber-pI/archive/2010/10/24/131056.html#131066dementrockdementrockSun, 24 Oct 2010 09:13:00 GMThttp://www.cppblog.com/Climber-pI/archive/2010/10/24/131056.html#131066

dementrock 2010-10-24 17:13 发表评论
]]>re: NOIp 2005 过河http://www.cppblog.com/Climber-pI/archive/2010/10/09/129084.html#129156ftiaschftiaschSat, 09 Oct 2010 00:53:00 GMThttp://www.cppblog.com/Climber-pI/archive/2010/10/09/129084.html#129156

ftiasch 2010-10-09 08:53 发表评论
]]>re: NOIp 2003 加分二叉树http://www.cppblog.com/Climber-pI/archive/2010/10/08/128667.html#129085Climber.pIClimber.pIFri, 08 Oct 2010 13:57:00 GMThttp://www.cppblog.com/Climber-pI/archive/2010/10/08/128667.html#129085不会爆栈么?

Climber.pI 2010-10-08 21:57 发表评论
]]>re: NOIP 2003 加分二叉树http://www.cppblog.com/Climber-pI/archive/2010/10/06/128667.html#128763dementrockdementrockWed, 06 Oct 2010 02:31:00 GMThttp://www.cppblog.com/Climber-pI/archive/2010/10/06/128667.html#128763

dementrock 2010-10-06 10:31 发表评论
]]>