活过

#include<iostream> #include<algorithm> #include<malloc.h> #include<bits/stdc++.h> using namespace std; const int MAXN=20; int G[MAXN][MAXN]={0},Nv,Ne; bool Visited[MAXN]={false}; bool Visited1[MAXN]={false}; int a[MAXN+1000]={-1...

#include<iostream> #include<algorithm> using namespace std; int main () { int n=0,s=0,g=1; cin>>n; int a[n]={0},b[n]={0},ans[n]={0}; for(int i=0;i<n;i++) { scanf("%d",&a[i]); } for(int i=0;i...