C++博客-superman-最新评论http://www.cppblog.com/superman/CommentsRSS.aspx聚精会神搞建设 一心一意谋发展zh-cnThu, 04 Jun 2009 06:30:25 GMTThu, 04 Jun 2009 06:30:25 GMTcnblogsre: ZOJ 1942 - Froggerhttp://www.cppblog.com/superman/archive/2009/05/12/51363.html#82723祝你好运！祝你好运！Tue, 12 May 2009 11:38:00 GMThttp://www.cppblog.com/superman/archive/2009/05/12/51363.html#82723什么意思？

祝你好运！ 2009-05-12 19:38 发表评论
]]>re: ZOJ 1298 - Domino Effecthttp://www.cppblog.com/superman/archive/2009/04/30/52491.html#81557xiaobaixiaobaiThu, 30 Apr 2009 05:11:00 GMThttp://www.cppblog.com/superman/archive/2009/04/30/52491.html#81557

xiaobai 2009-04-30 13:11 发表评论
]]>re: POJ 2157 - Mazehttp://www.cppblog.com/superman/archive/2009/03/07/54207.html#75821生活要低调生活要低调Sat, 07 Mar 2009 06:22:00 GMThttp://www.cppblog.com/superman/archive/2009/03/07/54207.html#75821

生活要低调 2009-03-07 14:22 发表评论
]]>re: ZOJ 1913 - Euclid's Gamehttp://www.cppblog.com/superman/archive/2009/01/28/44614.html#72655zczcWed, 28 Jan 2009 09:45:00 GMThttp://www.cppblog.com/superman/archive/2009/01/28/44614.html#72655

zc 2009-01-28 17:45 发表评论
]]>re: ZOJ 1148 - The Gamehttp://www.cppblog.com/superman/archive/2008/10/11/48269.html#63755小菜小菜Sat, 11 Oct 2008 10:36:00 GMThttp://www.cppblog.com/superman/archive/2008/10/11/48269.html#63755不知道是不是zoj升级后那些测试数据改了。。。

小菜 2008-10-11 18:36 发表评论
]]>re: ZOJ 1168 - Function Run Funhttp://www.cppblog.com/superman/archive/2008/10/08/46856.html#63482kkkkWed, 08 Oct 2008 08:41:00 GMThttp://www.cppblog.com/superman/archive/2008/10/08/46856.html#63482
#include<iostream> //为避免无限的或大量的重复递归，，怎么办？？，数组模拟

using namespace std;

const int N=100;
int f[N][N][N];

int recur(int a,int b,int c){

if(a<=0 || b<=0 || c<=0){
f[a][b][c]=1;
}
else if(a>20 || b>20 || c>20){
f[a][b][c]=recur(20,20,20);

}
else if(a<b && b<c){
if(f[a][b][c-1] == 0 )
f[a][b][c-1]=recur(a,b,c-1);
if(f[a][b-1][c-1]== 0)
f[a][b-1][c-1]=recur(a,b-1,c-1);
if(f[a][b-1][c] == 0 )
f[a][b-1][c]=recur(a,b-1,c);
f[a][b][c]=f[a][b][c-1]+f[a][b-1][c-1]-f[a][b-1][c];

}
else{
if(f[a-1][b][c] == 0)
f[a-1][b][c]=recur(a-1,b,c);
if(f[a-1][b][c-1] == 0)
f[a-1][b][c-1]=recur(a-1,b,c-1);
if(f[a-1][b-1][c] == 0)
f[a-1][b-1][c]=recur(a-1,b-1,c);
if(f[a-1][b-1][c-1]==0)
f[a-1][b-1][c-1]=recur(a-1,b-1,c-1);
f[a][b][c]=f[a-1][b][c]+f[a-1][b][c-1]+f[a-1][b-1][c]-f[a-1][b-1][c-1];
}

return f[a][b][c];

}

int main()
{

int a,b,c;

//cout<<"输入3个数: "<<endl;

while(cin>>a>>b>>c) {
//memset(f,0,sizeof(f));//写这个就超时。。。

if(a==-1 && b==-1 && c==-1) break;

if(a<=0 || b<=0 || c<=0)
cout<<"w("<<a<<", "<<b<<", "<<c<<") = "<<1<<endl;

else
cout<<"w("<<a<<", "<<b<<", "<<c<<") = "<<recur(a,b,c)<<endl;
}

return 0;

}

kk 2008-10-08 16:41 发表评论
]]>re: ZOJ 1251 - Box of Brickshttp://www.cppblog.com/superman/archive/2008/09/08/51739.html#61327灰色橙子灰色橙子Mon, 08 Sep 2008 11:35:00 GMThttp://www.cppblog.com/superman/archive/2008/09/08/51739.html#61327#include<iostream>
using namespace std;
int main()
{int n,i,a[51],sum,ave,text,ans;
text=0;
while(cin>>n&&n!=0)
{text++;
sum=ans=0;
for(i=0;i<n;i++)
{cin>>a[i];
sum+=a[i];}
ave=sum/n;
for(i=0;i<n;i++)
{if(a[i]>ave)ans+=a[i]-ave;}
cout<<"Set #"<<text<<endl;
cout<<"The minimum number of moves is "<<ans<<"."<<endl<<endl;
}
return 0;
}


灰色橙子 2008-09-08 19:35 发表评论
]]>shuai: ZUJ 1201 - Inversionhttp://www.cppblog.com/superman/archive/2008/08/22/45301.html#59627一览众山小一览众山小Fri, 22 Aug 2008 03:00:00 GMThttp://www.cppblog.com/superman/archive/2008/08/22/45301.html#59627#include<vector>
using namespace std;
int main()
{
int num;
char ch;
while(cin>>num&&num)
{
int data[51][2];
cin>>ch;
int i,j,k;
if(ch=='P')
{
for(i=0;i<num;i++)
{
cin>>data[i][0];
data[i][1]=0;//对数组初始化必须的
// cout<<data[i][0]<<" "<<data[i][1]<<endl;
}
for(i=num-1;i>=0;i--)
for(j=i-1;j>=0;j--)
if(data[j][0]>data[i][0])
data[i][1]++;


for(i=0;i<num-1;i++)
{
bool changed=true;
for(j=0;j<num-i-1;j++)
if(data[j][0]>data[j+1][0])
{
changed=false;
int temp1=data[j][0];
int temp2=data[j][1];
data[j][0]=data[j+1][0];
data[j][1]=data[j+1][1];
data[j+1][0]=temp1;
data[j+1][1]=temp2;
}
if(changed)
break;
}



for(i=0;i<num;i++)
{
cout<<data[i][1];
if(i<num-1)
cout<<" ";
}
cout<<endl;
}



if(ch=='I')
{
for(i=0;i<num;i++)
{
cin>>data[i][1];
data[i][0]=0;
// cout<<data[i][0]<<" "<<data[i][1]<<endl;
}


j=0;
for(i=0;i<num;i++)
if((!data[i][1])&&(!data[i][0]))
{
j++;
data[i][0]=i+1;
cout<<i+1;
if(j<num)
cout<<" ";
for(k=0;k<i;k++)
data[k][1]--;
i=-1;
}
cout<<endl;
}
}
return 0;
}



一览众山小 2008-08-22 11:00 发表评论
]]>re: ZOJ 1108 - FatMouse's Speedhttp://www.cppblog.com/superman/archive/2008/08/16/45390.html#59065qq:78393083qq:78393083Sat, 16 Aug 2008 08:39:00 GMThttp://www.cppblog.com/superman/archive/2008/08/16/45390.html#5906538 for(int i = 2; i <= n; i++)
39 {
40 for(int j = 1; j < i; j++)
41 if(mice[i].w > mice[j].w && mice[i].s < mice[j].s)
42 if(opt[i] < opt[j])
43 {
44 opt[i] = opt[j];
45 path[i] = j;
46 }
47 opt[i]++;
48 }
在这个最长不下降序列的构造里面的第47行opt[i]++一句有点问题，如果在
这个for(int j = 1; j < i; j++)循环里面如果没有找到符合条件的mice那么，opt【i】不应当加一，而且你这个代码在zoj上也没有AC。是否出了一点问题。

qq:78393083 2008-08-16 16:39 发表评论
]]>re: ZOJ 1558 - Euro Efficiencyhttp://www.cppblog.com/superman/archive/2008/08/01/44608.html#577744444Fri, 01 Aug 2008 08:28:00 GMThttp://www.cppblog.com/superman/archive/2008/08/01/44608.html#57774

44 2008-08-01 16:28 发表评论
]]>