Cod sursa(job #2625788)
Utilizator | Bucur Andreea andreea.bucur | Data | 6 iunie 2020 10:13:17 |
---|---|---|---|
Problema | Arbori de intervale | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("Date.in");
ofstream g("date.out");
vector <int> v;
int getMax(int a,int b,vector<int>v)
{
int max=0;
for(int i=a;i<=b;i++)
if(v[i]>max)
max=v[i];
return max;
}
int main()
{
int x,a,b,n,m,aux;
f>>n>>m;
v.push_back(0);
for(int i=1;i<=n;i++)
{f>>aux;
v.push_back(aux);
}
for(int i=1;i<=m;i++)
{
f>>x>>a>>b;
if(x==0)
g<<getMax(a,b,v)<<endl;
else if(x==1)
v[a]=v[b];
}
return 0;
}