 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
Re:对数组hash，这个果然很好很强大In Reply To:对数组hash，这个果然很好很强大 Posted by:happynp at 2008-07-06 21:15:10 > 从网上搞来的，好像是折叠法
> inline int hashcode(const int *v)
> {
> int s = 0;
> for(int i=0; i<k; i++)
> s=((s<<2)+(v[i]>>4))^(v[i]<<10);
> s = s % M;
> s = s < 0 ? s + M : s;
> return s;
> }
太NB了!!!膜拜!
我的乱七八糟HASH,...要700+ms. 就是把它当做一个N进制数处理, 还用了long long...
Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
