UVA 10656 - Maximum Sum (II)

来源:互联网 发布:在线aes算法 编辑:程序博客网 时间:2024/03/29 06:04

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

#include <iostream>#include <memory.h>#include <cstdio>#include <vector>using namespace std;#define MAX 1200int 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;}


原创粉丝点击