摘要: 简单模拟View Code #include <iostream>using namespace std;const int maxn=22;int n,N,p[maxn],le[maxn];bool first;void init(){ int i,j; cin>>n; first=true; for (i=1;i<=n;i++) { cin>>p[i]; le[i]=p[i]-p[i-1]; j=i; while (!le[j]) ... 阅读全文
posted @ 2012-12-25 16:02 undefined2024 阅读(433) 评论(0) 推荐(0)