codeforces 300A Array
2013-05-30 22:22
162 查看
把一个数组分成三个部分,第一部分积为正,第二部分积为负,第三部分积0;
发现自己总是处理不好细节问题。。。。
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
#define ls rt<<1
#define rs ls1
#define lson l,mid,ls
#define rson mid+1,r,rs
#define middle (l+r)>>1
#define eps (1e-9)
#define clr_all(x,c) memset(x,c,sizeof(x))
#define clr(x,c,n) memset(x,c,sizeof(x[0])*(n+1))
#define MOD 1000000007
#define inf 100000007
#define pi acos(-1.0)
#define for(i,a,b) for(int i=(a);i<(b);i++)
#define M 100+5
int a[M],n;
int main(){
int i,j;
while(~scanf("%d",&n)){
memset(a,0,sizeof(a));
for(i,0,n)
scanf("%d",&a[i]);
sort(a,a+n);
printf("1 %d\n",a[0]);
if(a[n-1]>0){
printf("1 %d\n",a[n-1]);
printf("%d",n-2);
for(i,1,n-1)printf(" %d",a[i]);
}else{
printf("2 %d %d\n",a[1],a[2]);
printf("%d",n-3);
for(i,3,n)printf(" %d",a[i]);
}
puts("");
}
return 0;
}
发现自己总是处理不好细节问题。。。。
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
#define ls rt<<1
#define rs ls1
#define lson l,mid,ls
#define rson mid+1,r,rs
#define middle (l+r)>>1
#define eps (1e-9)
#define clr_all(x,c) memset(x,c,sizeof(x))
#define clr(x,c,n) memset(x,c,sizeof(x[0])*(n+1))
#define MOD 1000000007
#define inf 100000007
#define pi acos(-1.0)
#define for(i,a,b) for(int i=(a);i<(b);i++)
#define M 100+5
int a[M],n;
int main(){
int i,j;
while(~scanf("%d",&n)){
memset(a,0,sizeof(a));
for(i,0,n)
scanf("%d",&a[i]);
sort(a,a+n);
printf("1 %d\n",a[0]);
if(a[n-1]>0){
printf("1 %d\n",a[n-1]);
printf("%d",n-2);
for(i,1,n-1)printf(" %d",a[i]);
}else{
printf("2 %d %d\n",a[1],a[2]);
printf("%d",n-3);
for(i,3,n)printf(" %d",a[i]);
}
puts("");
}
return 0;
}
相关文章推荐
- Codeforces 300A Array
- CodeForces 300A Array(水题)
- Codeforces 300A Array 【模拟】
- Codeforces 300A Array
- Codeforces 463C Gargari and Bishops
- Codeforces 602A Two Bases 【水题】
- 【Codeforces 696B】Another Sith Tournament &【JZOJ 4647】寻找
- CodeForces-747C
- Codeforces - 831D. Office Keys - dp、二分+贪心
- codeforces 26a(素数打表)
- Codeforces 101B Buses 排序+树状数组
- CodeForces 506D Mr. Kitayuta's Colorful Graph
- CodeForces 447A DZY Loves Hash
- Codeforces 629B Far Relative’s Problem(友谊的问题)
- codeforces 830B. Cards Sorting
- codeforces 897 B. Chtholly's request【构造回文数+递推】
- Codeforces 235B. Let's Play Osu!
- codeforces 547B. Mike and Feet 单调栈
- Codeforces 629C Famil Door and Brackets(DP)
- Codeforces 283E