Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Update fenwick.md#1410

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to ourterms of service andprivacy statement. We’ll occasionally send you account related emails.

Already on GitHub?Sign in to your account

Closed
arjunUpatel wants to merge1 commit intocp-algorithms:mainfromarjunUpatel:patch-1
Closed

Conversation

arjunUpatel
Copy link

The current bounds on j in the function do not match the summation a few lines above where the lower bound is g{i) and the upper bound is i. This change attempts to fix this disparity.

The current bounds on j in the function do not match the summation a few lines above where the lower bound is g{i) and the upper bound is i. This change attempts to fix this disparity.
@jxu
Copy link
Contributor

jxu commentedJan 6, 2025•
edited
Loading

The page is already being overhauled at#1376 so you can look at the draft there. Maybe I will just make the changes and merge

@adamant-pwn
Copy link
Member

It seems to me the current version is correct, as each$t[j]$ holds the sum from$g(j)$ to$j$, so when we update$i$, we only need to update$j$ s.t.$g(j) \leq i \leq j$.

Sign up for freeto join this conversation on GitHub. Already have an account?Sign in to comment
Reviewers
No reviews
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.

4 participants
@arjunUpatel@jxu@adamant-pwn@mhayter
[8]ページ先頭
©2009-2025 Movatter.jp