Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <math.h>
- #include <algorithm>
- #include <iomanip>
- #include <vector>
- using namespace std;
- int main()
- {
- int n,q;
- cin>>n>>q;
- vector<int> sf(n);
- for(int i = 0; i<n; i++)
- {
- cin>>sf[i];
- }
- vector<int> ans;
- int pol[n][n]= {0};
- for(int y = 0; y<n; y++)
- {
- int ror[n]= {0};
- for(int i = y; i<n; i++)
- {
- int k = sf[i];
- ror[k]++;
- }
- for(int i = 0; i<n; i++)
- {
- if(ror[i] ==0)
- {
- pol[y][n-1]= i;
- break;
- }
- }
- int mi = pol[y][n-1];
- for(int z = n-1; z>y; z--)
- {
- int k = sf[z];
- ror[k]--;
- if(ror[k] == 0 && k<mi )
- {
- mi = k;
- }
- pol[y][z-1] = mi;
- }
- }
- for(int i = 0; i<n; i++)
- {
- for(int y = 0; y<n; y++)
- {
- cout<<pol[i][y]<<" ";
- }
- cout<<endl;
- }
- for(int i = 0; i<q; i++)
- {
- char w ;
- cin>>w;
- if(w=='!')
- {
- int l = 0;
- int r = 0;
- cin>>l>>r;
- l--;
- sf[l] = r;
- for(int y = 0; y<n; y++)
- {
- int ror[n]= {0};
- for(int i = y; i<n; i++)
- {
- int k = sf[i];
- ror[k]++;
- }
- for(int i = 0; i<n; i++)
- {
- if(ror[i] ==0)
- {
- pol[y][n-1]= i;
- break;
- }
- }
- int mi = pol[y][n-1];
- for(int z = n-1; z>y; z--)
- {
- int k = sf[z];
- ror[k]--;
- if(ror[k] == 0 && k<mi )
- {
- mi = k;
- }
- pol[y][z-1] = mi;
- }
- }
- }
- else
- {
- int l = 0;
- int r = 0;
- cin>>l>>r;
- l--;
- r--;
- cout<<pol[l][r]<<endl;
- // cout<<endl;
- }
- }
- return 0;
- }
- /*
- 6 8
- 4 1 0 2 2 3
- ? 1 6
- ? 4 6
- ? 2 5
- ? 2 6
- ! 3 3
- ? 1 6
- ! 4 0
- ? 1 6
- */
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement