2013年7月19日
枚举生成可重集排列
摘要： /*枚举生成可重集排列*/#include #include#include#include#include#include#include#includeusing namespace std;#define maxn 2600000int A[maxn];int P[maxn];int sum;void print_p(int n,int *A,int *P,int cur){ int i,j; if(cur==n) { for(i=0; i#include#include#include#include#include#include#includeusi... 阅读全文
posted @ 2013-07-19 17:31 myth_HG 阅读(282) 评论(0) 推荐(0)
枚举生成1~n的排序
摘要： /*枚举生成1~n的排列*/#include #include#include#include#include#include#include#includeusing namespace std;#define maxn 2600000int A[maxn];void print_p(int n,int *A,int cur){ int i,j; if(cur==n) { for(i=0;i<n;i++) printf("%d ",A[i]); printf("\n"); } else { for(i... 阅读全文
posted @ 2013-07-19 16:33 myth_HG 阅读(255) 评论(0) 推荐(0)
铁轨(栈)
摘要： #include #include#include#include#include#include#include#includeusing namespace std;#define LL long longconst int MAXN = 1000+10;int n,target[MAXN];int main(){ while(~scanf("%d",&n)) { stack s; int A=1,B=1,i; for(i =1 ;i<=n;i++) scanf("%d",&target[i]); i... 阅读全文
posted @ 2013-07-19 15:27 myth_HG 阅读(282) 评论(0) 推荐(0)