Cod sursa(job #2442569)
Utilizator | Tigoan Matei-Daniel TigoanMatei | Data | 24 iulie 2019 13:21:48 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int n,minim=0,maxim=INT_MIN,a,b,last,x,aa;
int main()
{
in>>n;
a=b=1;
for(int i=1;i<=n;i++)
{
last=x;
in>>x;
x+=last;
if(x-minim>maxim)
{
maxim=x-minim;
b=i;
aa=a;
}
if(x<minim)
{
minim=x;
a=i+1;
}
}
out<<maxim<<" "<<aa<<" "<<b;
return 0;
}