Pagini recente » Cod sursa (job #1289587) | Cod sursa (job #2450284) | Cod sursa (job #1660939) | Cod sursa (job #288993) | Cod sursa (job #2908930)
/*
Maximum Subsequence Sum Problem
*/
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#define _CRT_SECURE_NO_WARNINGS
void maxSubSum()
{
}
int main()
{
int i, maxSum=-INT_MAX;
int start_idx=0, end_idx=0, temp=0, sum=0, num, n;
FILE* g;
g = fopen("ssm.out", "wt");
FILE* f;
f = fopen("ssm.in", "rt");
fscanf(f,"%d",&n);
for(i=0;i<n;i++)
{
fscanf(f,"%d",&num);
if(sum<0)
{
sum=num;
temp=i;
}
else{
sum+=num;
}
if(sum>maxSum)
{
maxSum = sum;
start_idx=temp;
end_idx=i;
}
}
fprintf(g,"%d %d %d", maxSum,start_idx,end_idx);
fclose(f);
fclose(g);
return 0;
}