using System; using System.IO; using System.Collections.Generic; using System.Linq; using System.Numerics; using System.Runtime.CompilerServices; using System.Text; using System.Globalization; using System.Threading; using static System.Math; namespace FertiLib.Contest.B { public class Solver { Scanner cin; StreamWriter cout; bool isMultipleTestCases = false; public void Solve() { var n = cin.ReadInt(); var a = cin.ReadLongArray(n); var p = a.Select((p, index) => (p, index)).OrderByDescending(p => p.p * 10000000 + p.index).ToArray(); var seg = new SegmentTree<(long a, long dp2, int count, int dpCount)>(n, (x, y) => (x.a + y.a, x.dp2 + y.dp2, x.count + y.count, x.dpCount + y.dpCount), (0, 0, 0, 0)); ModInt ans = 0; for (int i = 0; i < n; i++) { var cur = p[i].index; var (resA, resDp, resCount,resDpCount) = seg.GetResult(0, cur); seg.Update(cur, (a[cur], resA + resCount * a[cur], 1, resCount)); ans += (ModInt)resDp + resDpCount * a[cur]; } Console.WriteLine(ans); } public Solver(Scanner cin, StreamWriter cout) { this.cin = cin; this.cout = cout; } public void Start() { int _t = 1; if (isMultipleTestCases) _t = cin.ReadInt(); while (_t-- > 0) Solve(); } public static void YESNO(bool condition) => Console.WriteLine(condition ? "YES" : "NO"); public static void YesNo(bool condition) => Console.WriteLine(condition ? "Yes" : "No"); public static void yesno(bool condition) => Console.WriteLine(condition ? "yes" : "no"); } public class SegmentTree { public int Count { get; private set; } T[] tree; readonly Func func; readonly T init; public SegmentTree(int size, Func func, T init) { int n = 1; while (n <= size) { n *= 2; } Count = n; tree = Enumerable.Repeat(init, 2 * n - 1).ToArray(); this.func = func; this.init = init; } public SegmentTree(IEnumerable items, Func func, T init) : this(items.Count(), func, init) { var array = items.ToArray(); for (int i = 0; i < array.Length; i++) { tree[i + Count - 1] = array[i]; } UpdateAll(); } public T this[int index] { get => this.tree[index + Count - 1]; private set => this.tree[index + Count - 1] = value; } public void Update(int index, T value) { index += Count - 1; tree[index] = value; while (index > 0) { index = (index - 1) / 2; tree[index] = func(tree[index * 2 + 1], tree[index * 2 + 2]); } } void UpdateAll() { int n = Count / 2; while (n > 0) { for (int i = 0; i < n; i++) { tree[n - 1 + i] = func(tree[2 * (n - 1 + i) + 1], tree[2 * (n - 1 + i) + 2]); } n /= 2; } } // Attention: [l, r). This result does not include r-th item. public T GetResult(int l, int r) => GetResult(l, r, 0, 0, Count); T GetResult(int l, int r, int k, int a, int b) { if (b <= l || r <= a) return init; if (l <= a && b <= r) return tree[k]; var vl = GetResult(l, r, 2 * k + 1, a, (a + b) / 2); var vr = GetResult(l, r, 2 * k + 2, (a + b) / 2, b); return func(vl, vr); } } public class Set : IEnumerable where T : IComparable { Node root; readonly IComparer comparer; readonly Node nil; public bool IsMultiSet { get; set; } public Set() : this(Comparer.Default) { } public Set(IComparer comparer) { nil = new Node(default); root = nil; this.comparer = comparer; } public Set(Comparison comparison) : this(Comparer.Create(comparison)) { } public T this[int index] { get { if (index < 0 || root.Count < index) throw new ArgumentOutOfRangeException(); return Find(root, index); } } public bool Add(T x) => Insert(ref root, x); public bool Remove(T x) => Erase(ref root, x); public void RemoveAt(int index) { if (index < 0 || Count < index) throw new ArgumentOutOfRangeException(); EraseAt(ref root, index); } public bool Contains(T x) => this.Count == 0 ? false : EqualRange(x) > 0; public int LowerBound(T x) => BinarySearch(root, x, false); public int UpperBound(T x) => BinarySearch(root, x, true); public int EqualRange(T x) => UpperBound(x) - LowerBound(x); public void Clear() => root = nil; public T Min() => root.Min.Value; public T Max() => root.Max.Value; public T[] Items { get { var a = new T[root.Count]; var k = 0; Walk(root, a, ref k); return a; } } public int Count => root.Count; public int Height => root.Height; public IEnumerator GetEnumerator() { return Items.AsEnumerable().GetEnumerator(); } System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator() => GetEnumerator(); bool Insert(ref Node p, T x) { if (p.Count == 0) { p = new Node(x); p.Left = p.Right = nil; p.Update(); return true; } bool ret; var t = comparer.Compare(p.Value, x); if (t > 0) { ret = Insert(ref p.Left, x); } else if (t < 0) { ret = Insert(ref p.Right, x); } else { if (IsMultiSet == true) ret = Insert(ref p.Left, x); else return false; } Balance(ref p); return ret; } bool Erase(ref Node p, T x) { if (p.Count == 0) return false; var t = comparer.Compare(p.Value, x); bool ret; if (t < 0) ret = Erase(ref p.Right, x); else if (t > 0) ret = Erase(ref p.Left, x); else { ret = true; if (p.Right.Count == 0) { p = p.Left; return true; } if (p.Left.Count == 0) { p = p.Right; return true; } p.Value = p.Left.Max.Value; Erase(ref p.Left, p.Left.Max.Value); } Balance(ref p); return ret; } void EraseAt(ref Node p, int index) { var count = p.Left.Count; if (index < count) EraseAt(ref p.Left, index); else if (index > count) EraseAt(ref p.Right, index - count - 1); else { if (p.Left.Count == 0) { p = p.Right; return; } if (p.Right.Count == 0) { p = p.Left; return; } p.Value = p.Left.Max.Value; EraseAt(ref p.Left, index - 1); } Balance(ref p); } void Walk(Node t, T[] a, ref int k) { if (t.Count == 0) return; Walk(t.Left, a, ref k); a[k++] = t.Value; Walk(t.Right, a, ref k); } void Balance(ref Node p) { var balance = p.Left.Height - p.Right.Height; if (balance < -1) { if (p.Right.Left.Height - p.Right.Right.Height > 0) RotateR(ref p.Right); RotateL(ref p); } else if (balance > 1) { if (p.Left.Left.Height - p.Left.Right.Height < 0) RotateL(ref p.Left); RotateR(ref p); } else p.Update(); } T Find(Node p, int index) { if (index < p.Left.Count) return Find(p.Left, index); if (index > p.Left.Count) return Find(p.Right, index - p.Left.Count - 1); return p.Value; } void RotateL(ref Node p) { var r = p.Right; p.Right = r.Left; r.Left = p; p.Update(); r.Update(); p = r; } void RotateR(ref Node p) { var l = p.Left; p.Left = l.Right; l.Right = p; p.Update(); l.Update(); p = l; } int BinarySearch(Node p, T x, bool isUpperBound) { if (p.Count == 0) throw new NullReferenceException(); var node = p; var ret = 0; while (p.Count != 0) { var cmp = p.Value.CompareTo(x); if (cmp > 0 || (!isUpperBound && cmp == 0)) { p = p.Left; } else { ret += p.Left.Count + 1; p = p.Right; } } return ret; } public override string ToString() { return string.Join(", ", Items); } class Node { public Node Left, Right; public T Value { get; set; } public int Count { get; private set; } public int Height { get; private set; } public Node Min { get { if (Left.Count == 0) return this; else return Left.Min; } } public Node Max { get { if (Right.Count == 0) return this; else return Right.Max; } } public Node(T value) => Value = value; public void Update() { Count = Left.Count + Right.Count + 1; Height = Math.Max(Left.Height, Right.Height) + 1; } public override string ToString() => $"Count = {Count}, Value = {Value}"; } } public struct ModInt : IComparable, IEquatable { public static long MOD = 998244353; public static bool isModPrime { get; set; } private readonly long num; public ModInt(long n) { num = n; isModPrime = true; } public override string ToString() => num.ToString(); public static ModInt operator +(ModInt l, ModInt r) { long x = l.num + r.num; if (x >= MOD) x -= MOD; return new ModInt(x); } public static ModInt operator -(ModInt l, ModInt r) { long x = l.num - r.num; if (x < 0) x += MOD; return new ModInt(x); } public static ModInt operator *(ModInt l, ModInt r) => new ModInt((l.num * r.num) % MOD); public static ModInt operator /(ModInt l, ModInt r) => l * r.Inverse(); public static ModInt operator ++(ModInt x) { var tmp = x + new ModInt(1); return tmp; } public static ModInt operator --(ModInt x) { var tmp = x - new ModInt(1); return tmp; } public static bool operator >(ModInt l, ModInt r) => l.CompareTo(r) > 0; public static bool operator <(ModInt l, ModInt r) => l.CompareTo(r) < 0; public static bool operator >=(ModInt l, ModInt r) => l.CompareTo(r) >= 0; public static bool operator <=(ModInt l, ModInt r) => l.CompareTo(r) <= 0; public static bool operator ==(ModInt l, ModInt r) => l.Equals(r); public static bool operator !=(ModInt l, ModInt r) => !l.Equals(r); public static implicit operator long(ModInt x) => x.num; public static implicit operator ModInt(long n) { n %= MOD; if (n < 0) n += MOD; return new ModInt(n); } public ModInt Inverse() => Inverse(this, MOD); public static ModInt Inverse(ModInt x) => Inverse(x.num, MOD); public static long Inverse(long x, long m) { if (x % m == 0) throw new DivideByZeroException(); long a = x, b = m, u = 1, v = 0; while (b > 0) { long t = a / b; a -= t * b; long p = a; a = b; b = p; // swap(a, b); u -= t * v; p = u; u = v; v = p; // swap(u, v); } u %= m; if (u < 0) u += m; return u; } public static ModInt Pow(long x, long n) { x %= MOD; long now = 1; if (isModPrime) n %= MOD - 1; for (; n > 0; n /= 2, x = x * x % MOD) { if (n % 2 == 1) now = now * x % MOD; } return new ModInt(now); } public int CompareTo(ModInt x) { if (num == x.num) return 0; if (num > x.num) return 1; return -1; } public bool Equals(ModInt x) => num == x.num; public override bool Equals(object obj) => obj is ModInt m && num == m.num; public override int GetHashCode() { return HashCode.Combine(num); } } public static class Program { public static void Main(string[] args) { var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; Console.SetOut(sw); var cin = new Scanner(); var solver = new Solver(cin, sw); solver.Start(); Console.Out.Flush(); } } public static class Extention { public static string Join(this IEnumerable x, string separator = "") => string.Join(separator, x); public static int UpperBound(this IList list, T value) => list.BinarySearch(value, true, 0, list.Count, Comparer.Default); public static int LowerBound(this IList list, T value) => list.BinarySearch(value, false, 0, list.Count, Comparer.Default); public static int BinarySearch(this IList list, T value, bool isUpperBound, int index, int length, Comparer comparer) { var ng = index - 1; var ok = index + length; while (ok - ng > 1) { var mid = ng + (ok - ng) / 2; var res = comparer.Compare(list[mid], value); if (res < 0 || (isUpperBound && res == 0)) ng = mid; else ok = mid; } return ok; } public static bool Chmax(ref this T a, T b) where T : struct, IComparable { if (a.CompareTo(b) >= 0) return false; a = b; return true; } public static bool Chmin(ref this T a, T b) where T : struct, IComparable { if (a.CompareTo(b) <= 0) return false; a = b; return true; } } public class Scanner { string[] s; int i; char[] separator = new char[] { ' ' }; public Scanner() { s = new string[0]; i = 0; } public string Read() => ReadString(); public string ReadString() { if (i < s.Length) return s[i++]; string st = Console.ReadLine(); while (st == "") st = Console.ReadLine(); s = st.Split(separator, StringSplitOptions.RemoveEmptyEntries); if (s.Length == 0) return ReadString(); i = 0; return s[i++]; } public string[] ReadStringArray(int N) { string[] Array = new string[N]; for (int i = 0; i < N; i++) { Array[i] = ReadString(); } return Array; } public int ReadInt() => int.Parse(ReadString()); public int[] ReadIntArray(int N, int add = 0) { int[] Array = new int[N]; for (int i = 0; i < N; i++) { Array[i] = ReadInt() + add; } return Array; } public long ReadLong() => long.Parse(ReadString()); public long[] ReadLongArray(int N, long add = 0) { long[] Array = new long[N]; for (int i = 0; i < N; i++) { Array[i] = ReadLong() + add; } return Array; } public double ReadDouble() => double.Parse(ReadString()); public double[] ReadDoubleArray(int N, double add = 0) { double[] Array = new double[N]; for (int i = 0; i < N; i++) { Array[i] = ReadDouble() + add; } return Array; } public T1 ReadValue() => (T1)Convert.ChangeType(ReadString(), typeof(T1)); public (T1, T2) ReadValue() { var inputs = ReadStringArray(2); var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1)); var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2)); return (v1, v2); } public (T1, T2, T3) ReadValue() { var inputs = ReadStringArray(3); var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1)); var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2)); var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3)); return (v1, v2, v3); } public (T1, T2, T3, T4) ReadValue() { var inputs = ReadStringArray(4); var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1)); var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2)); var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3)); var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4)); return (v1, v2, v3, v4); } public (T1, T2, T3, T4, T5) ReadValue() { var inputs = ReadStringArray(5); var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1)); var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2)); var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3)); var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4)); var v5 = (T5)Convert.ChangeType(inputs[4], typeof(T5)); return (v1, v2, v3, v4, v5); } public (T1, T2, T3, T4, T5, T6) ReadValue() { var inputs = ReadStringArray(6); var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1)); var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2)); var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3)); var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4)); var v5 = (T5)Convert.ChangeType(inputs[4], typeof(T5)); var v6 = (T6)Convert.ChangeType(inputs[5], typeof(T6)); return (v1, v2, v3, v4, v5, v6); } public (T1, T2, T3, T4, T5, T6, T7) ReadValue() { var inputs = ReadStringArray(7); var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1)); var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2)); var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3)); var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4)); var v5 = (T5)Convert.ChangeType(inputs[4], typeof(T5)); var v6 = (T6)Convert.ChangeType(inputs[5], typeof(T6)); var v7 = (T7)Convert.ChangeType(inputs[6], typeof(T7)); return (v1, v2, v3, v4, v5, v6, v7); } public T1[] ReadValueArray(int N) { var v1 = new T1[N]; for (int i = 0; i < N; i++) { v1[i] = ReadValue(); } return v1; } public (T1[], T2[]) ReadValueArray(int N) { var (v1, v2) = (new T1[N], new T2[N]); for (int i = 0; i < N; i++) { var (t1, t2) = ReadValue(); v1[i] = t1; v2[i] = t2; } return (v1, v2); } public (T1[], T2[], T3[]) ReadValueArray(int N) { var (v1, v2, v3) = (new T1[N], new T2[N], new T3[N]); for (int i = 0; i < N; i++) { var (t1, t2, t3) = ReadValue(); v1[i] = t1; v2[i] = t2; v3[i] = t3; } return (v1, v2, v3); } public (T1[], T2[], T3[], T4[]) ReadValueArray(int N) { var (v1, v2, v3, v4) = (new T1[N], new T2[N], new T3[N], new T4[N]); for (int i = 0; i < N; i++) { var (t1, t2, t3, t4) = ReadValue(); v1[i] = t1; v2[i] = t2; v3[i] = t3; v4[i] = t4; } return (v1, v2, v3, v4); } public (T1[], T2[], T3[], T4[], T5[]) ReadValueArray(int N) { var (v1, v2, v3, v4, v5) = (new T1[N], new T2[N], new T3[N], new T4[N], new T5[N]); for (int i = 0; i < N; i++) { var (t1, t2, t3, t4, t5) = ReadValue(); v1[i] = t1; v2[i] = t2; v3[i] = t3; v4[i] = t4; v5[i] = t5; } return (v1, v2, v3, v4, v5); } public (T1[], T2[], T3[], T4[], T5[], T6[]) ReadValueArray(int N) { var (v1, v2, v3, v4, v5, v6) = (new T1[N], new T2[N], new T3[N], new T4[N], new T5[N], new T6[N]); for (int i = 0; i < N; i++) { var (t1, t2, t3, t4, t5, t6) = ReadValue(); v1[i] = t1; v2[i] = t2; v3[i] = t3; v4[i] = t4; v5[i] = t5; v6[i] = t6; } return (v1, v2, v3, v4, v5, v6); } public (T1[], T2[], T3[], T4[], T5[], T6[], T7[]) ReadValueArray(int N) { var (v1, v2, v3, v4, v5, v6, v7) = (new T1[N], new T2[N], new T3[N], new T4[N], new T5[N], new T6[N], new T7[N]); for (int i = 0; i < N; i++) { var (t1, t2, t3, t4, t5, t6, t7) = ReadValue(); v1[i] = t1; v2[i] = t2; v3[i] = t3; v4[i] = t4; v5[i] = t5; v6[i] = t6; v7[i] = t7; } return (v1, v2, v3, v4, v5, v6, v7); } } }