Cod sursa(job #478193)
Utilizator | Hotea Cristian crouch | Data | 17 august 2010 18:36:23 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
int n,k,x,y,aux,s[6000001],t,pozmin,pozmax;
int main()
{
ifstream f("ssm.in",ios::in);
ofstream g("ssm.out",ios::out);
f>>n;
int max=-2147483647;
int min=2147483647;
for(int i=1;i<=n;i++)
{
f>>x;
s[i]=s[i-1]+x;
if(s[i]>max)
{
max=s[i];
pozmax=i;
}
if(s[i]<min)
{
min=s[i];
pozmin=i+1;
}
}
g<<max-min<<" "<<pozmin<<" "<<pozmax;
}