-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathArrayManipulation.cpp
89 lines (64 loc) · 1.91 KB
/
ArrayManipulation.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
#include <bits/stdc++.h>
using namespace std;
vector<string> split_string(string);
// Complete the arrayManipulation function below.
long arrayManipulation(int n, vector<vector<int>> queries) {
vector<int> cumSum(n, 0);
int l = queries.size(), a, b, k;
for(int i = 0; i < l; ++i) {
a = queries[i][0];
b = queries[i][1];
k = queries[i][2];
cumSum[a-1] += k;
if(b < n) {
cumSum[b] -= k;
}
}
long maxSum = 0, sum = 0;
for(int i = 0; i < n; ++i) {
sum += cumSum[i];
maxSum = max(sum, maxSum);
}
return maxSum;
}
int main()
{
ofstream fout(getenv("OUTPUT_PATH"));
string nm_temp;
getline(cin, nm_temp);
vector<string> nm = split_string(nm_temp);
int n = stoi(nm[0]);
int m = stoi(nm[1]);
vector<vector<int>> queries(m);
for (int i = 0; i < m; i++) {
queries[i].resize(3);
for (int j = 0; j < 3; j++) {
cin >> queries[i][j];
}
cin.ignore(numeric_limits<streamsize>::max(), '\n');
}
long result = arrayManipulation(n, queries);
fout << result << "\n";
fout.close();
return 0;
}
vector<string> split_string(string input_string) {
string::iterator new_end = unique(input_string.begin(), input_string.end(), [] (const char &x, const char &y) {
return x == y and x == ' ';
});
input_string.erase(new_end, input_string.end());
while (input_string[input_string.length() - 1] == ' ') {
input_string.pop_back();
}
vector<string> splits;
char delimiter = ' ';
size_t i = 0;
size_t pos = input_string.find(delimiter);
while (pos != string::npos) {
splits.push_back(input_string.substr(i, pos - i));
i = pos + 1;
pos = input_string.find(delimiter, i);
}
splits.push_back(input_string.substr(i, min(pos, input_string.length()) - i + 1));
return splits;
}