Cod sursa(job #1977820)
Utilizator | Vulsan Bianca Maria BiancaMariaVulsan | Data | 6 mai 2017 11:23:25 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 55 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
#include <limits.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int n,i;
f>>n;
int v[n], minn, maxsum,best,st=1,dr;
maxsum=INT_MIN;
for(i=1; i<=n; i++)
{f>>v[i]; v[i]=v[i-1]+v[i];}
minn=v[0];
for(i=1; i<=n; i++)
{
best=v[i]-minn;
if(minn>v[i]) {minn=v[i]; st=i+1;}
if(best>maxsum) {maxsum=best; dr=i;}
}
g<<maxsum<<' '<<st<<' '<<dr;
f.close();
g.close();
return 0;
}