Hackerrank "Poisonous Plants"

I had the same BFS idea as one of the AC code This:because dying pattern are spead from the initial dying ones:)

#include <iostream>#include<queue>#include<vector>using namespacestd;intMain () {intN CIN >>N; Vector<int> P (N +1, -1); //Dancing Linksvector<int> Pre (N +1); Vector<int> Nex (N +1); //Markersvector<int> Day (N +1);  for(inti =0; i < N; i + +) {cin>>P[i]; }            //Fill Initial Queuequeue<int>Q;  for(inti = n1; i >0; i--) {Pre[i]=i-1; Nex[i]=i+1; if(P[i] > p[i-1]) {Day[i]=1;        Q.push (i); }    }        intAns =0;  while(!Q.empty ()) {        intCur=Q.front ();        Q.pop (); Ans=Day[cur]; //Dis-link Current Indexpre[nex[cur]]=Pre[cur]; Nex[pre[cur]]=Nex[cur]; if(P[nex[cur]) >P[pre[cur]]) {Day[nex[cur]]= day[cur]+1;        Q.push (Nex[cur]); }} cout<< ans <<Endl; return 0;}

Hackerrank "Poisonous Plants"