Cod sursa(job #2676199)
Utilizator | Boscanici Adrian Gabriel gabiadi | Data | 23 noiembrie 2020 17:59:35 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
#include <limits.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int p,u,x,sCrt=0,pCrt=1,sMax=-(1<<30),N;///sMax foarte mic
int main()
{
f>>N;
for(int i=1;i<=N;i++)
{
f>>x;
if(sCrt>=0)
sCrt+=x;
else
{
sCrt=x;
pCrt=i;
}
if(sMax<sCrt)
{
sMax=sCrt;
p=pCrt;
u=i;
}
}
g<<sMax<<' '<<p<<' '<<u;
return 0;
}