FlandreScarle7/Codeforces-SolutionsA
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

update code of 1927D

Browse Source
This commit is contained in:
ShazidMahsrafi 2024-02-08 13:53:09 +06:00
parent f5e966d953
commit 982a7478cb
1 changed files with 6 additions and 22 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

28
Codes/1927 D - Find the Different Ones!/1927D.cpp
View File

@ -59,25 +59,14 @@ void solve()
{ {
int n; int n;
cin>>n; cin>>n;
vector<int>v(n),pre(n); vector<int>v(n),next(n,-1);
for(auto &i:v) cin>>i; for(auto &i:v) cin>>i;
vector<pair<int,int>>ind(n);
pre[0]=0;
for(int i=1; i<n; ++i) for(int i=1; i<n; ++i)
{ {
if(v[i]!=v[i-1]) if(v[i]==v[i-1]) next[i]= next[i-1];
{ else next[i]=i-1;
pre[i]=pre[i-1]+1;
ind[i]={i-1,i};
}
else
{
pre[i]=pre[i-1];
ind[i]={ind[i-1].ff,i};
}
} }
dbg(next);
int q; int q;
cin>>q; cin>>q;
while(q--) while(q--)
@ -85,13 +74,8 @@ void solve()
int l,r; int l,r;
cin>>l>>r; cin>>l>>r;
l--,r--; l--,r--;
int ans=pre[r]-pre[l]; if(next[r]<l) cout<<-1<<" "<<-1<<endl;
if(ans) else cout<<next[r]+1<<" "<<r+1<<endl;
{
cout<<ind[r].ff+1<<" "<<ind[r].ss+1<<endl;
}
else
cout<<-1<<" "<<-1<<endl;
} }
cout<<endl; cout<<endl;
} }