ACCENTURE EXAM HELP ! CISCO EXAM !

Make it 7k everyone ✅🎉🎉 Share @codeing_area

#include <bits/stdc++.h> using namespace std; #define ll long long ll dp[10005][2]; const int mod = (1e9 + 7); ll solve(ll i, ll o, ll n, ll k, vector<ll> &v) { if (i > n) { return 0; } if (dp[i][o] != -1) return dp[i][o]; ll ans = 0; if (o == 0) { for (int j = i; j < min(n + 1, i + k); j++) { ans = max(ans, solve(j + 1, 1 - o, n, k, v)) % mod; } } else { ll ta = 0; ll mx = 0; for (int j = i; j < min(n + 1, i + k); j++) { if (ta + v[j] >= 0) { ta += v[j]; mx = max(mx, ta); } else { ta = 0; } ll c = solve(j + 1, 1 - o, n, k, v) % mod; ans = max(ans, ((j - i + 1) * mx) % mod + c % mod); } } return dp[i][o] = ans; } int main() { ll n, k; cin >> n >> k; vector<ll> v; ll neg = 0; for (int i = 0; i < n; i++) { ll x; cin >> x; v.push_back(x); if (x <= 0) neg++; } if (neg == v.size()) { cout << 0 << endl; return 1; } memset(dp, -1, sizeof(dp)); cout << max(solve(0, 0, v.size() - 1, k, v), solve(0, 1, v.size() - 1, k, v)) << endl; } Array segment

Count sequence 2 Share @codeing_area

Shar the group everyone ✅💯💯 I will share maximum codess Share @codeing_area Share share share ✅😉

Now check every one

The Infosys online test for the SP role has been scheduled for Sunday,  21st January, 2024 from 2:30 PM to 5:30 PM.  The test window is stuck and the team is working from backend and it will be sorted in next 10 minutes  Don't refresh and close the window. Stay there. The test will be starting soon and the time will be extended. rgds,

Infosys exam successfully done by remote access ✅✅✅✅ 3/3 codes successfully passed with all the test caes passed ✅✅ Contact for placement exam @srksvk

Second done ✅✅✅✅

First' done ✅✅✅

Service now exam successfully done by remote access ✅✅✅ 2/2 codes passed with all the tets case passed ✅ Ctc -25 lpa Contact for placement exam help @srksvk

Infosys Exam help avilavble Book your slots fast Contact @VickySir12 100% Clearance Guarantee... remote access available