Cod sursa(job #2908928)

Utilizator Shapka-NevedimkaSemenenco Stanislav Shapka-Nevedimka Data 7 iunie 2022 01:22:55
Problema Subsecventa de suma maxima Scor 0
Compilator c-32 Status done
Runda Arhiva educationala Marime 0.78 kb
/*
    Maximum Subsequence Sum Problem
*/

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define  _CRT_SECURE_NO_WARNINGS

void maxSubSum()
{
    
}

int main()
{
	int i, maxSum=-INT_MAX, start_idx, end_idx, temp, sum=0, num;
    FILE* g;
    g = fopen("ssm.out", "wt");
    FILE* f;
    f = fopen("read.txt", "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;
}