Pagini recente » Cod sursa (job #1186078) | Clasament tarni_und_veli | Cod sursa (job #2519045) | Cod sursa (job #2509081) | Cod sursa (job #2424417)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("arbint.in");
ofstream fout ("arbint.out");
int n,m,x,z[100005],i,j,mx,a,b;
int maxi(int i, int j)
{ int a, b, m;
if (i==j)
return z[i];
else
{ m = (i+j)/2;
a = max(i, m);
b = max(m+1, j);
if (a>b)
return a;
else
return b;
}
}
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++)fin>>z[i];
for(j=1;j<=m;j++)
{
fin>>x>>a>>b;
if(x==0){
for(i=a;i<=b;i++)if(z[i]==maxi(a,b))fout<<i<<endl;
}else z[a]=b;
}
return 0;
}