Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Blog
Triplet sum in array
#include<bits/stdc++.h> using namespace std; int dos(vector<int>&v,int l,int r,int rem_sum) { while(l<r) { if(v[l]+v[r]==rem_sum) { return 1; } else if(v[l]+v[r]>rem_sum) { r--; } else { l++; } } return 0; } int tos(vector<int>&v,int n,int target) { for(int i=n-1;i>=2;i--) { if(dos(v,0,i-1,target-v[i])) return 1; } return 0; } int main() { int t; cin>>t; while(t--) { int n;int target; cin>>n; cin>>target; vector<int>v(n); for(int i=0;i<n;i++) cin>>v[i]; sort(v.begin(),v.end()); cout<<tos(v,n,target)<<endl; } }
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
so
basic observation leads to dp OPTIMIZATION from O(n^3) to O(n^2) !!! (sopj : AMBLE)
Day3
Ultimate gauss
isBST
Updated Linked Lists - 5/10/2017 V4.0
most Frequent word
Radix sort
Tejas choudhari
Jilebi Nimki
Please log in to post a comment.