2012年7月14日

<cf>Two Problems

摘要: A. Two Problemstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA boy Valera registered on siteCodeforcesasValera, and wrote his firstCodeforces Round #300. He boasted to a friend Arkady about winning as much asxpoints for his first contest. But A 阅读全文

posted @ 2012-07-14 20:47 铁树银花 阅读(234) 评论(0) 推荐(0) 编辑

<poj 1046>Color Me Less

摘要: Color Me LessTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 25873Accepted: 12417DescriptionA color reduction is a mapping from a set of discrete colors to a smaller one. The solution to this problem requires that you perform just such a mapping in a standard twenty-four bit RGB color spac. 阅读全文

posted @ 2012-07-14 12:02 铁树银花 阅读(204) 评论(0) 推荐(0) 编辑

欧氏距离(Euclidean distance)

摘要: 原文地址:http://www.blogjava.net/spec-second/archive/2008/08/17/222609.html欧氏距离(Euclidean distance)欧氏距离定义: 欧氏距离( Euclidean distance)是一个通常采用的距离定义,它是在m维空间中两个点之间的真实距离。在二维和三维空间中的欧式距离的就是两点之间的距离,二维的公式是 d = sqrt((x1-x2)^+(y1-y2)^) 三维的公式是 d=sqrt(x1-x2)^+(y1-y2)^+(z1-z2)^) 推广到n维空间,欧式距离的公式是 d=sqrt( ∑(xi1-xi2)^ ) 阅读全文

posted @ 2012-07-14 10:48 铁树银花 阅读(1870) 评论(0) 推荐(0) 编辑

<poj1028> Web Navigation

摘要: Web NavigationTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 23618Accepted: 10534DescriptionStandard web browsers contain features to move backward and forward among the pages recently visited. One way to implement these features is to use two stacks to keep track of the pages that can be 阅读全文

posted @ 2012-07-14 10:32 铁树银花 阅读(188) 评论(0) 推荐(0) 编辑

导航