摘要： 转自：http://blog.csdn.net/dgq8211/article/details/7952825如图，如何求得直线 AB与直线 CD的交点P？以上内容摘自《算法艺术与信息学竞赛》。思路就是利用叉积求得点P分线段DC的比，然后利用高中学习的定比分点坐标公式求得分点P的坐标。看不懂的可以去... 阅读全文

摘要： Dragon BallsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3245Accepted Submission(s): 1252Proble... 阅读全文

摘要： Problem I: Plants vs. Zombies HD Super ProPlants versus Zombies HD Super Pro is a game played not a grid, but on a connected graph G with no cycles (i... 阅读全文

摘要： 1500. Pass LicensesTime limit: 2.5 secondMemory limit: 64 MBA New Russian Kolyan believes that to spend his time in traffic jams is below his dignity.... 阅读全文

摘要： 321. The Spy NetworkTime limit per test: 0.5 second(s)Memory limit: 65536 kilobytesinput: standardoutput: standardThe network of spies consists ofNint... 阅读全文

摘要： A+BTime Limit:2000MSMemory Limit:65536KTotal Submissions:811Accepted:371DescriptionTheResearch Institute of Given Strings(RIGS) is a well-known place ... 阅读全文

摘要： 题目来自大神博客的线段树专题http://www.notonlysuccess.com/index.php/segment-tree-complete/hdu1166 敌兵布阵题意:O(-1)思路:O(-1)线段树功能:update:单点增减 query:区间求和#include #include ... 阅读全文

摘要： B -CryptographyTime Limit:5000MSMemory Limit:32768KB64bit IO Format:%lld & %lluSubmitStatusPracticeZOJ 2671DescriptionYoung cryptoanalyst Georgie is p... 阅读全文

摘要： http://www.csie.ntnu.edu.tw/~u91029/Matching.html 1 int nx,ny; 2 int mx[N],my[N]; 3 bool vy[N]; 4 bool g[N][N]; 5 6 int decode(int x,int y) {return... 阅读全文

摘要： introduction to OJhttp://acdream.info/topic/101ji suan ji he mo banhttp://wenku.baidu.com/link?url=JNBUwmSX6uWJQXTjs3RmHqThCNydjlXb2f6rSt-SyKC1-KLraL4... 阅读全文