DS静态查找之顺序查找

#include <iostream>
using namespace std;
int main() {
    int n,t,target;
    cin>>n;
    int a[n+1];
    for(int i=1;i<n+1;i++)
        cin>>a[i];
    cin>>t;
    while(t--){
        cin>>target;
        int i;
        for(i=n;i>0;i--)
            if(a[i]==target&&i){
                cout<<i<<endl;
                break;
            }
        if(i==0)
            cout<<"error"<<endl;
    }
    return 0;
}