题解 | #定位查找#
定位查找
https://ac.nowcoder.com/acm/problem/22219
采用stl实现，注意此处应有多组输入的处理
#include<bits/stdc++.h>
using namespace std;int main(){
int n,k,m;
while(cin>>n){
vector<int> l1;
for(int i=1;i<=n;i++){
cin>>k;
l1.push_back(k);
}
cin>>m;
auto pos = find(l1.begin(),l1.end(),m);
if(pos!=l1.end()) cout<<distance(l1.begin(),pos)<<endl;
else cout<<"No"<<endl;
}
}
