- [THUPC 2023 决赛] 喵了个喵 III
做到一半。。。。。
- 2023-7-18 15:21:10 @
#include
using namespace std; int ans[3000],a1[1500],a2[1500],a_1,a_2,m; bool bo=true; int ab(int a[],int flag,int sum,int i) { if (sum>m*2) { return 0; bo=false; } if (flag0 && a1[a_1]!=a2[a_2]) { return 0; bo=false; } if (flag1) a1[++a_1]=a[i]; if (flag==2) a2[++a_2]=a[i]; a[i]=ab(a,2,sum+1,i+1); a[i]=ab(a,1,sum+1,i+1); a[i]=ab(a,0,sum+1,i); break; }
int main () { cin m; for (int i=0;i<m;i++) cin >> a[i];
}
0 comments
No comments so far...
Information
- ID
- 8643
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 7
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By