Cod sursa(job #2239366)
| Utilizator | Data | 10 septembrie 2018 17:26:37 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int n,v[6000006];
int sp[6000006];
int minim = INT_MAX;
int maxim = INT_MIN;
int minpoz=1,maxpoz=1;
int main()
{
f>>n;
for(int i=1;i<=n;i++)
f>>v[i];
for(int i=1;i<=n;i++)
{
sp[i] = sp[i-1] + v[i];
if(sp[i-1]<minim){
minim = sp[i-1];
minpoz = i;
}
if(sp[i] - minim > maxim){
maxim = sp[i] - minim;
maxpoz = i;
}
}g<<maxim<<' '<<minpoz<<' '<<maxpoz;
return 0;
}
