Constructive Algorithms question that I have no idea how to solve

Revision en11, by yeeeet, 2020-12-29 02:56:37

After getting destroyed by the problem mentioned in this blog

I decided to get revenge on the problemsetter(dvdg6566) by setting a problem related to his that he couldn't solve :). After thinking a while I came up with this problem. Given two integers N and I, construct a sequence of non-negative integers with length N with inequality I where inequality is defined as

$$$I = \sum\limits_{i=1}^N \bigg( \sum\limits_{j=i}^N rangemax(i,j) \bigg)$$$

But after thinking a while again, I realized I couldn't solve it either. I could only construct a solution for $$$I>=(2*(n-1)*(n-2))$$$ but for smaller I, I have no idea how to do it. Any help would be appreciated thanks!.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en11 English yeeeet 2020-12-29 02:56:37 0 (published)
en10 English yeeeet 2020-12-29 02:56:25 14 Tiny change: 'integers N<=100000 and I<=1e18, construc' -> 'integers N and I, construc' (saved to drafts)
en9 English yeeeet 2020-12-27 17:16:15 0 (published)
en8 English yeeeet 2020-12-27 17:15:51 27 Tiny change: 'quence of length N ' -> 'quence of non-negative integers with length N ' (saved to drafts)
en7 English yeeeet 2020-12-27 15:15:04 42 Tiny change: 'blemsetter by settin' -> 'blemsetter([user:dvdg6566]) by settin'
en6 English yeeeet 2020-12-27 15:11:47 500 Tiny change: 'ution for I>=(2*(n-1)*(n-2)) but for s' -> 'ution for $I>=(2*(n-1)*(n-2))$ but for s' (published)
en5 English yeeeet 2020-12-27 15:05:39 3
en4 English yeeeet 2020-12-27 15:04:16 108
en3 English yeeeet 2020-12-27 15:01:37 53
en2 English yeeeet 2020-12-27 15:00:09 84 Tiny change: '\nhttps://codeforces.me/3c4b9a/bob.png\n' -> '\nhttps://freeimage.host/i/Kjx1g2'
en1 English yeeeet 2020-12-27 14:51:02 240 Initial revision (saved to drafts)