Cod sursa(job #1133267)
| Utilizator | Data | 4 martie 2014 17:57:22 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.7 kb |
#include <iostream>
#include <fstream>
using namespace std;
int a[6000000];
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
int n;
long long mx,mn,u=0,s=0;
f >> n;
f >> a[1];
mx=a[1];
mn=a[1];
for(int i=2;i<=n;++i)
{
f >> a[i];
a[i]=a[i]+a[i-1];
if(a[i]>mx)
{
mx=a[i];
s=i;
}
if(a[i]<mn)
{
mn=a[i];
u=i+1;
}
if(a[i]=mn)
{
if(i+1<u)
{
mn=a[i];
u=i+1;
}
}
}
g << mx-mn << " " << u << " " << s;
return 0;
}
