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 |
奈何感觉算法复杂度为O(n^4) -。-for ( i = 0 ; i < n ; i++ ) for ( j = 0 ; j < n ; j++ ) { ....; for ( k = 0 ; k < n ; k++ ) for ( t = i ; t <= j ; t++ ) ....; } 这个感觉是O(n^4)啊。大家都说O(n^3),请教,谢谢。 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator