Mai intai trebuie sa te autentifici.
Cod sursa(job #1329960)
| Utilizator | Data | 30 ianuarie 2015 02:42:38 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
#define Nmax 6000000
using namespace std;
int s[Nmax],i,n,ma,mi,nr,a,b;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int main()
{
f>>n;
s[0]=0; a=32000; b=-32000;
for (i=1;i<=n;i++)
{
f>>nr; s[i]=s[i-1]+nr;
if (s[i]<a) {mi=i; a=s[i];}
}
for (i=mi+1;i<=n;i++)
if ((s[i]-s[mi])>b){ma=i; b=s[i]-s[mi];}
g<<s[ma]-s[mi]<<" "<<mi+1<<" "<<ma;
f.close();
g.close();
return 0;
}
