//Longest Arithmetic Progression int Solution::solve(const vector &A) { int n=A.size(); if(n<3) return n; int ans=1; //Runs at O(n3) complexity // for(int i=0;i>v(n); for(int i=0;i