forked from cipherhacker/DSAToolSet
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathvector copy.cpp
More file actions
53 lines (51 loc) · 1.02 KB
/
Copy pathvector copy.cpp
File metadata and controls
53 lines (51 loc) · 1.02 KB
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
#include <iostream>
#include<vector>
#include<algorithm>
#define ll long long
using namespace std;
int main()
{
ll t,n,i,l,q,j,m,p,r;
cin>>n>>q;
vector<int>v;
for(i=0;i<n;i++)
{
cin>>m;
v.push_back(m);
//cout<<v[i]<<" ";
}
while(q--)
{
cin>>p>>l>>r;
if(p==1)
{
v[l-1]=r;
}
else if(p==2)
{
ll flag=0;
vector<unsigned int>v1(&v[l-1],&v[r]);
sort(v1.begin(),v1.end(),greater<int>());
/*for(i=0;i<v1.size();i++)
{
cout<<v1[i]<<" ";
}*/
//cout<<v1[v1.size()-1]+v1[v1.size()-2]+v1[v1.size()-3]<<endl;
ll m=v1.size();
//cout<<m<<endl;
for(i=0;i<m-2;i++)
{
if(v1[i]<v1[i+1]+v1[i+2])
{
cout<<v1[i]+v1[i+1]+v1[i+2]<<endl;
flag=1;
break;
}
}
if(flag==0)
{
cout<<0<<endl;
}
}
}
}