very Easy Solution, Without DP
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int maximumSumSubsequence(int[] nums, int[][] queries) {\n        int totalSum = 0;\n        for (int[] query : queries) {\n            int pos = query[0];\n            int x= query[1];\n            nums[pos] = x;\n            int maxSum = NoAdjacent(nums);\n            totalSum = (totalSum + maxSum) %  1000000007;\n        }\n        return totalSum;\n    }\n    public int NoAdjacent(int[] nums) {\n        if (nums == null || nums.length == 0) return 0;\n        int incl = 0;\n        int excl = 0;\n        for (int num : nums) {\n            int newExcl = Math.max(incl, excl);\n            incl = excl + num;\n            excl = newExcl;\n        }\n        return Math.max(incl, excl);  \n    }\n}\n```
['Java']