2019年8月31日
Can you answer these queries I SPOJ - GSS1 （线段树维护区间连续最大值/最大连续子段和）
摘要： You are given a sequence A[1], A[2], ..., A[N] . ( |A[i]| ≤ 15007 , 1 ≤ N ≤ 50000 ). A query is defined as follows: Query(x,y) = Max { a[i]+a[i+1]+... 阅读全文
posted @ 2019-08-31 11:23 茄子Min 阅读(161) 评论(0) 推荐(0) 编辑