Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #define _CRT_SECURE_NO_WARNINGS
- #define _SCL_SECURE_NO_WARNINGS
- #include <iostream>
- #include <iomanip>
- #include <algorithm>
- #include <string>
- #include <vector>
- #include <list>
- #include <stack>
- #include <queue>
- #include <cstring>
- #include <cstdio>
- #include <map>
- #include <set>
- #include <bitset>
- #include <cmath>
- typedef long long ll;
- using namespace std;
- #define pb push_back
- #define pp pop
- #define ins insert
- #define rmv remove
- //#include<bits/stdc++>
- int main()
- {
- int n, m;
- cin >> n >> m;
- vector<int> a;
- ll opt[n + 1];
- a.push_back(0);
- for (int i = 0; i < n; i++)
- {
- ll x;
- cin >> x;
- a.pb(x%m);
- }
- opt[0] = 0;
- for (int i = 1; i <= n; i++)
- {
- opt[i] = max((opt[i - 1] + a[i]) % m, opt[i - 1]);
- }
- cout << opt[n] << endl;
- return 0;
- }
Add Comment
Please, Sign In to add comment