-
Notifications
You must be signed in to change notification settings - Fork 0
/
arrayMani.cpp
115 lines (83 loc) · 1.74 KB
/
arrayMani.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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
using namespace std;
/*João Cláudio V.Soares*/
long long int berifica(long long int n, vector<vector<long long int>> query){
vector<long long int>ve(n,0);
long long int a,b,k,max=0;
for(long long j=0; j<query.size(); j++)
{
a = query[j][0];
b =query[j][1];
k =query[j][2];
for(long long int i = a; i <= b ; i++)
{
ve[i-1]+=k;
if(ve[i-1] > max)
{
max = ve[i-1];
}
}
}
cout <<max<<endl;
return 0;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
long long int n,m,a,b,k,max=0, auxA=0, auxB=0;
vector<long long int>vet;
vector<vector<long long int>> query;
cin >>n>>m;
while(m--)
{
cin >>a>>b>>k;
vet.push_back(a);
vet.push_back(b);
vet.push_back(k);
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
using namespace std;
long long int berifica(long long int n, vector<vector<long long int>> query){
vector<long long int>ve(n,0);
long long int a,b,k,max=0;
for(long long j=0; j<query.size(); j++)
{
a = query[j][0];
b =query[j][1];
k =query[j][2];
for(long long int i = a; i <= b ; i++)
{
ve[i-1]+=k;
if(ve[i-1] > max)
{
max = ve[i-1];
}
}
}
cout <<max<<endl;
return 0;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
long long int n,m,a,b,k;
vector<long long int>vet;
vector<vector<long long int>> query;
cin >>n>>m;
while(m--)
{
cin >>a>>b>>k;
vet.push_back(a);
vet.push_back(b);
vet.push_back(k);
query.push_back(vet);
vet.clear();
}
berifica(n,query);
return 0;
}