暴力该怎么优化啊,开O2后最后两个点还是T了

代码如下：

#include<bits/stdc++.h>
using namespace std;
const int N = 1e6 + 20;
int a[N],b[N];
int main(){
	int n;
	cin>>n;
	cin>>a[1];
	for(int i = 2;i<=n;i++){
		cin>>a[i];
	}
	int t;
	cin>>t;
	while(t--){
		int m;
		cin>>m;
		for(int i =1;i<=m;i++){
			cin>>b[i];
		}
		int wei = 0;
		bool flag = 0;
		for(int i = 1;i<=m;i++){
			flag = 0;
			for(int op = wei;op<=n;op++){
				//cout<<b[i]<<" "<<a[op]<<endl;
				if(a[op] == b[i]){
					flag = 1;
					wei = op;
					break;
				}
				else{
					flag = 0;
				}
			}
			if(flag == 0){
				cout<<"NIE"<<endl;
				break;
			}
		}
		if(flag == 1){
			cout<<"TAK"<<endl;
		}
	}
	return 0;
}