C++博客-风一样消逝的青春-最新评论http://www.cppblog.com/acmiyou/CommentsRSS.aspxAcmiyou/Sulingrzh-cnWed, 12 May 2010 12:32:01 GMTWed, 12 May 2010 12:32:01 GMTcnblogsre: OSG学习 Drawable 与 几何体创建[未登录]http://www.cppblog.com/acmiyou/archive/2009/10/02/94182.html#97735米游米游Thu, 01 Oct 2009 16:17:00 GMThttp://www.cppblog.com/acmiyou/archive/2009/10/02/94182.html#97735

米游 2009-10-02 00:17 发表评论
]]>re: OSG学习 Drawable 与 几何体创建[未登录]http://www.cppblog.com/acmiyou/archive/2009/09/30/94182.html#97636zerozeroWed, 30 Sep 2009 03:12:00 GMThttp://www.cppblog.com/acmiyou/archive/2009/09/30/94182.html#97636是如何决定立方体的方向？？？

zero 2009-09-30 11:12 发表评论
]]>re: pku 1191 棋盘分割 (DP)(三)http://www.cppblog.com/acmiyou/archive/2009/09/12/78547.html#95990米游米游Sat, 12 Sep 2009 03:22:00 GMThttp://www.cppblog.com/acmiyou/archive/2009/09/12/78547.html#95990@shizu


米游 2009-09-12 11:22 发表评论
]]>re: pku 1191 棋盘分割 (DP)(三)http://www.cppblog.com/acmiyou/archive/2009/09/09/78547.html#95640shizushizuWed, 09 Sep 2009 00:14:00 GMThttp://www.cppblog.com/acmiyou/archive/2009/09/09/78547.html#95640

shizu 2009-09-09 08:14 发表评论
]]>re: pku 1191 棋盘分割 (DP)(三)[未登录]http://www.cppblog.com/acmiyou/archive/2009/08/22/78547.html#94083米游米游Sat, 22 Aug 2009 05:13:00 GMThttp://www.cppblog.com/acmiyou/archive/2009/08/22/78547.html#94083这是以前写代码所没有注意到的一个好习惯>_< 不写注释。。现在的代码好多了。可惜我已经好久没有做ACM的题了

米游 2009-08-22 13:13 发表评论
]]>re: pku 1191 棋盘分割 (DP)(三)http://www.cppblog.com/acmiyou/archive/2009/08/22/78547.html#94075sakuratestsakuratestSat, 22 Aug 2009 03:09:00 GMThttp://www.cppblog.com/acmiyou/archive/2009/08/22/78547.html#94075

sakuratest 2009-08-22 11:09 发表评论
]]>re: opengl学习 nehe opengl lesson_9http://www.cppblog.com/acmiyou/archive/2009/08/20/92629.html#93953李海威李海威Thu, 20 Aug 2009 13:48:00 GMThttp://www.cppblog.com/acmiyou/archive/2009/08/20/92629.html#93953

李海威 2009-08-20 21:48 发表评论
]]>re: opengl 使用bmp位图纹理(8-bit 24bit)http://www.cppblog.com/acmiyou/archive/2009/08/20/91811.html#93949李海威李海威Thu, 20 Aug 2009 13:25:00 GMThttp://www.cppblog.com/acmiyou/archive/2009/08/20/91811.html#93949

李海威 2009-08-20 21:25 发表评论
]]>re: opengl学习 nehe opengl lesson_6http://www.cppblog.com/acmiyou/archive/2009/07/26/90386.html#91187米游米游Sat, 25 Jul 2009 17:01:00 GMThttp://www.cppblog.com/acmiyou/archive/2009/07/26/90386.html#91187我是写到第10节了。暂时还没空发上来...

米游 2009-07-26 01:01 发表评论
]]>re: opengl学习 nehe opengl lesson_6http://www.cppblog.com/acmiyou/archive/2009/07/23/90386.html#90968李海威李海威Thu, 23 Jul 2009 14:03:00 GMThttp://www.cppblog.com/acmiyou/archive/2009/07/23/90386.html#90968

李海威 2009-07-23 22:03 发表评论
]]>re: opengl学习 nehe opengl lesson_6http://www.cppblog.com/acmiyou/archive/2009/07/23/90386.html#90967李海威李海威Thu, 23 Jul 2009 13:54:00 GMThttp://www.cppblog.com/acmiyou/archive/2009/07/23/90386.html#90967

李海威 2009-07-23 21:54 发表评论
]]>re: opengl学习 nehe opengl lesson_3http://www.cppblog.com/acmiyou/archive/2009/07/16/90138.html#90238李海威李海威Thu, 16 Jul 2009 07:47:00 GMThttp://www.cppblog.com/acmiyou/archive/2009/07/16/90138.html#90238

李海威 2009-07-16 15:47 发表评论
]]>re: 有道难题...http://www.cppblog.com/acmiyou/archive/2009/06/04/86302.html#86746NONOThu, 04 Jun 2009 05:53:00 GMThttp://www.cppblog.com/acmiyou/archive/2009/06/04/86302.html#86746
public int getValue(int n) {
int mask = (n ^ (n - 1));
int ret = 0;
int previndex = 0;
while (mask > 0) {
if (check(previndex)) {
ret = 1 - ret;
}
int index = n & mask;
if (index >= n) {
break;
}
previndex = index;

mask = (n & (~mask));
mask = (mask ^ (mask - 1));
}
return ret;
}

static boolean check(int n) {
int a = (int) Math.sqrt(n);
return a * a == n;
}
}



NO 2009-06-04 13:53 发表评论
]]>re: 有道难题...http://www.cppblog.com/acmiyou/archive/2009/06/02/86302.html#86518yhjyhjTue, 02 Jun 2009 02:51:00 GMThttp://www.cppblog.com/acmiyou/archive/2009/06/02/86302.html#86518{
unsigned long k = 0;
while(n>0){
unsigned long i = 0,j = 0,m = 0;
while(j<n){
if(j==0) j=1;
j=j*2;
i++;
// cout<<"j="<<j<<endl;
}
// cout<<"i="<<i<<endl;
if(n==j)
return 1;
else
n=n-j/2;
// cout<<"n="<<n<<endl;
while(m*m<n)
m++;
if(n==m*m)
k++;
// cout<<"k="<<k<<endl;
}
if(k%2==0)
return 0;
else
return 1;
}

yhj 2009-06-02 10:51 发表评论
]]>re: 使用后缀数组 解决zoj 3199 Longest Repeated Substringhttp://www.cppblog.com/acmiyou/archive/2009/05/16/82357.html#83120米游米游Sat, 16 May 2009 06:57:00 GMThttp://www.cppblog.com/acmiyou/archive/2009/05/16/82357.html#83120求解那里出了问题..需要枚举了应该

米游 2009-05-16 14:57 发表评论
]]>re: 使用后缀数组 解决zoj 3199 Longest Repeated Substringhttp://www.cppblog.com/acmiyou/archive/2009/05/16/82357.html#83097scut_solarscut_solarFri, 15 May 2009 17:36:00 GMThttp://www.cppblog.com/acmiyou/archive/2009/05/16/82357.html#83097例如：defgdefgzdefge
答案应该是4吧，但是用这种方法解的答案是0

scut_solar 2009-05-16 01:36 发表评论
]]>re: 使用后缀数组 解决zoj 3199 Longest Repeated Substringhttp://www.cppblog.com/acmiyou/archive/2009/05/13/82357.html#82770米游米游Wed, 13 May 2009 02:40:00 GMThttp://www.cppblog.com/acmiyou/archive/2009/05/13/82357.html#82770

米游 2009-05-13 10:40 发表评论
]]>re: 使用后缀数组 解决zoj 3199 Longest Repeated Substringhttp://www.cppblog.com/acmiyou/archive/2009/05/13/82357.html#82769米游米游Wed, 13 May 2009 02:39:00 GMThttp://www.cppblog.com/acmiyou/archive/2009/05/13/82357.html#82769 谢谢指点..的确是那样的..

米游 2009-05-13 10:39 发表评论
]]>re: 使用后缀数组 解决zoj 3199 Longest Repeated Substringhttp://www.cppblog.com/acmiyou/archive/2009/05/12/82357.html#82681[NKU]Angel[NKU]AngelTue, 12 May 2009 06:19:00 GMThttp://www.cppblog.com/acmiyou/archive/2009/05/12/82357.html#82681{
int i=0,d=0,j,s;
memset(h,0,sizeof(h));
//height[i]=LCP(i-1,i)
for(i=0;i<len;i++)
{
if(rank[i]==0)
{
h[rank[i]]=0;//←这个地方应该是h[i]=0吧。。
continue;
}
j=rank[i]-1;
d=rank[i];
//Suffix(Rank[i])与Suffix(Rank[i-1]比较相等的字符个数
// i==0或者h[i-1]<=1则从头开始比较两个后缀
//否则的话表示已经有前h[i-1]-1个字符相等 继续比较后面相等字符的个数
if(i==0||h[i-1]<=1)
s=0;
else
s=h[i-1]-1;
for(;sa[d]+s<len&&sa[j]+s<len;s++)
if(str[sa[d]+s]!=str[sa[j]+s]) break;
h[i]=s;
//其实可以根据height[rank[i]]=h[i]求height[]这样可以省去h[]数组空间
}
//heigth[i]=h[sa[i]]
for(i=0;i<len;i++)
height[i]=h[sa[i]];


}


[NKU]Angel 2009-05-12 14:19 发表评论
]]>re: 参数搜索(求最优解问题)[未登录]http://www.cppblog.com/acmiyou/archive/2009/04/30/79676.html#81541willwillThu, 30 Apr 2009 03:16:00 GMThttp://www.cppblog.com/acmiyou/archive/2009/04/30/79676.html#81541

will 2009-04-30 11:16 发表评论
]]>