Cod sursa(job #984274)
| Utilizator | Data | 13 august 2013 23:11:42 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int i,n,v[6000001],nrf,nr,maxi,st;
int main()
{
fin>>n;
for(i=1;i<=n;++i)
fin>>v[i];
maxi=INT_MIN;
for(i=n-1;i;--i)
{
if (v[i]<v[i+1]||v[i+1]>0)
{v[i]+=v[i+1];++nr;}
else nr=0;
if(v[i]>maxi)
{maxi=v[i];st=i;nrf=nr;}
}
fout<<maxi<<" "<<st<<" "<<st+nrf;
return 0;
}
