Cod sursa(job #1138194)
| Utilizator | Data | 9 martie 2014 18:40:50 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
#define maxn 6000000
#define inf (1<<30)
int a[maxn];
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
int n;
int mx,mn,u=0,s=0;
f >> n;
mx=-inf;
mn=0;
int pozmin=0;
for(int i=1;i<=n;++i)
{
f >> a[i];
a[i]=a[i]+a[i-1];
if(a[i]-mn>mx)
{
mx=a[i]-mn;
s=i;
u=pozmin+1;
}
if(a[i]<mn)
{
mn=a[i];
pozmin = i;
}
}
g << mx << " " << u << " " << s;
return 0;
}
