Cod sursa(job #1360530)
| Utilizator | Data | 25 februarie 2015 15:55:41 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 75 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, s[6000000], v[6000000],x,y;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>v[i];
s[i]=s[i-1]+v[i];
}
x=max_element(s+2, s+n+1)-s;
y=min_element(s+2, s+x+1)-s;
fout<<s[x]-s[y]<<' '<<y+1<<' '<<x;
fin.close();
fout.close();
return 0;
}
