求安慰求开导# astrology - 星座物语
a*y
1 楼
find and print the first longest
ascending or descending contiguous subsequence for a vector of
integers.
我的程序：
int main(){
// create a vector
vector v1(10);
for (vector::iterator iter=v1.begin();iter!=v1.end();iter++)
cin>>*iter;
cout<
int n_up=1;
int n_upmax=1;
int n_down=1;
int n_downmax=1;
int i_marker_up=0;
int i_marker_down=0;
for (int iter=0;iter
ascending or descending contiguous subsequence for a vector of
integers.
我的程序：
int main(){
// create a vector
vector
for (vector
cin>>*iter;
cout<
int n_up=1;
int n_upmax=1;
int n_down=1;
int n_downmax=1;
int i_marker_up=0;
int i_marker_down=0;
for (int iter=0;iter
