HDU 1003,wrong answer#include#includeint A[100000];int maxsum;int start;int max;int main(){int count;int num;int end;int sum;start=0;scanf("%d",&count);for(int i=0;i

HDU 1003,wrong answer#include#includeint A[100000];int maxsum;int start;int max;int main(){int count;int num;int end;int sum;start=0;scanf("%d",&count);for(int i=0;i
HDU 1003,wrong answer
#include
#include
int A[100000];
int maxsum;
int start;
int max;
int main()
{
int count;int num;
int end;int sum;
start=0;
scanf("%d",&count);
for(int i=0;i

HDU 1003,wrong answer#include#includeint A[100000];int maxsum;int start;int max;int main(){int count;int num;int end;int sum;start=0;scanf("%d",&count);for(int i=0;i
printf("%d %d %d\n\n",maxsum,start+1,end+1);
需要两次换行的,因为每个case后都一个空白行