Lily's Homework

  • + 0 comments

    I tried to implement your algorithm but I am getting half test cases as wrong answer. Can you help?

    include

    using namespace std;

    int main() { int n; vectora; cin>>n; int u,temp1; maph; for(u=0;u>temp1; a.push_back(temp1); h[temp1]=u; } vectorb(a.begin(),a.end()); vectorc(a.begin(),a.end()); sort(b.begin(),b.end()); int count_a=0; int count_b=0; int i,j,sec; for(i=0;i()); for(i=0;i