Napoleon2004的博客

#include<bits/stdc++.h>using namespace std;int a[31],b[31];int l,i,j,t;void spin(int x){ int k,c[31]; for(k=x;k>=1;k--) c[k]=a[x-k+1]; for(k=x;k>=1;k--) a[k]=c[k];}int main(){...

#include<bits/stdc++.h>using namespace std;int main(){ int n,i,j,ok=0; while(scanf("%d",&n)!=EOF){ if(ok)printf("\n"); if(ok==0)ok=1; printf("2 %d %d\n",n,n); for(i=1;i<=n;i++...

#include<bits/stdc++.h>using namespace std;int s1[16000010];int s2[16000010];int main(){ int t,i,j,n,ans; int a[4010],b[4010],c[4010],d[4010]; scanf("%d",&t); while(t--){ scanf("%d...

#include<bits/stdc++.h>using namespace std;const int m=5010;struct node{ int a,b,c,d,key;}s[m];int n,s1[m],s2[m],mp[m];int cmp1(node q,node p){ if(q.c!=p.c)return q.c<p.c; return q.a...

#include<bits/stdc++.h>int main(){ int n; while(scanf("%d",&n)&&n){ long long a,ans=0,last=0; for(int i=0;i<n;i++){ scanf("%lld",&a); ans+=abs(last); last+=a;...

#include<bits/stdc++.h>using namespace std;int n,i,l,r,t,ans,a[1000010];int main(){ scanf("%d",&t); while(t--){ scanf("%d",&n); for(i=1;i<=n;i++) scanf("%d",&a[i]); ..