作业帮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
来源：学生作业帮助网 编辑：作业帮 时间：2024/07/13 04:27:16
![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(](/uploads/image/z/13882470-6-0.jpg?t=HDU+1003%2Cwrong+answer%23include%23includeint+A%5B100000%5D%3Bint+maxsum%3Bint+start%3Bint+max%3Bint+main%28%29%7B%05int+count%3Bint+num%3B%05int+end%3Bint+sum%3B%05start%3D0%3B%05scanf%28%22%25d%22%2C%26count%29%3B%05for%28int+i%3D0%3Bi)
x)p U0400)/KWH+.O-RK)MIљy%
@e@k
&V悙%E%0A(Y
b'AdBy) n[ #91/MCI5EIG
IӚ5-H2 &H s20brP]z·Y[
&
!A(̗P W!/rTP䃕)QL^L5:`
uhB=rNËeOv,yfE/<բt';v=[dǪԧ^6}r{
m @ H
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后都一个空白行