HDU 2625 Say love to you once again
2012-06-07 10:12
477 查看
http://acm.hdu.edu.cn/showproblem.php?pid=2625
随便写出一个dfs然后猥琐随机化法剪枝,第一次AC的战绩是1/18,还跑了700+ms,随机50w次成功率还这么低。。。最近rp真是太烂了有木有。。。
View Code
随便写出一个dfs然后猥琐随机化法剪枝,第一次AC的战绩是1/18,还跑了700+ms,随机50w次成功率还这么低。。。最近rp真是太烂了有木有。。。
View Code
#include <iostream> #include <cstdlib> #include <ctime> using namespace std ; int map[30][30] ; int n ; int ans ; int vis[30] ; void dfs(int d) { if(d==n) { int temp=0 ; for(int i=0;i<n;i++) if(vis[i]) for(int j=0;j<n;j++) if(!vis[j]) temp+=map[i][j] ; if(ans<temp) ans=temp ; return ; } vis[d]=1 ; dfs(d+1) ; vis[d]=0 ; dfs(d+1) ; } int main() { while(~scanf("%d",&n)) { for(int i=0;i<n;i++) for(int j=0;j<n;j++) scanf("%d",&map[i][j]) ; memset(vis,0,sizeof(vis)) ; ans=0 ; if(n<20) dfs(0) ; else { int times=500000 ; srand(time(0)) ; while(times--) { vis[rand()%n]^=1 ; int temp=0 ; for(int i=0;i<n;i++) if(vis[i]) for(int j=0;j<n;j++) if(!vis[j]) temp+=map[i][j] ; if(ans<temp) ans=temp ; } } printf("%d.\n",ans) ; } return 0 ; }
相关文章推荐
- OpenStack Ceilometer 监控项扩展(havana) - Once again to see you
- hdu 1214 圆桌会议 数论 How strong I want to love you again!
- OpenStack Ceilometer 监控项扩展(havana) - Nice to see you once again
- 紫荆花开之say love to the girl you love
- 数组nice to see you again
- HDU 1867 A + B for you again 字符串拼接 kmp
- HDU 1867 A + B for you again (KMP)
- hdu 1867(A + B for you again) KMP的应用 /hdu 2594(Simpsons’ Hidden Talents) KMP
- DBMS course :You’ve Got to Find What You Love
- UFT 12 – Top 5 New Features you are going to Love
- HDU 1867 A + B for you again 字符匹配
- robbin的自白:You've got to find what you love
- Effective 3D Exporter Design: How to Make Artists Love You——01
- Failed to export using the options you specified. Please check your options and try again
- HDU 1867--A + B for you again【KMP】
- Wrapper class webservice.jaxws.SayHi is not found. Have you run APT to generate them?
- KMP——HDU 1867 A + B for you again
- hdu 2816 I Love You Too
- hdu 1867 A + B for you again(KMP)
- hdu 1867 A + B for you again