UVA 10656 - Maximum Sum (II)

一直以为是连续的才算sub-sequence,WA无数

#include <iostream>
#include <memory.h>
#include <cstdio>
#include <vector>
using namespace std;
#define MAX 1200
int seq[MAX],n;
vector<int>ans;
int main(){
	while (scanf("%d",&n)&&n)
	{
		ans.clear();

		int maxSum=0,cnt=0;

		for (int i=0;i<n;++i){
			scanf("%d",&seq[i]);
			maxSum+=seq[i];
			if(seq[i]){
				if(cnt>0)printf(" ");
				printf("%d",seq[i]);
				++cnt;
			}
		}
		if(maxSum==0)printf("0");
		printf("\n");
	}
	return 0;
}