Cod sursa(job #1122668)
| Utilizator | Data | 25 februarie 2014 19:45:04 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include<cstdio>
using namespace std;
int s,d,x,y,n,i,a,b,c,st=1,dr=0,rez=1<<31;
int MAX(int a, int b)
{
if(a>=b){++dr; return a;}
else{st=dr=i; return b;}
}
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;++i)
{
y=c;
scanf("%d",&x);
c=MAX(x+y,x);
if(c>rez){rez=c; s=st; d=dr;}
}
printf("%d %d %d",rez,s,d);
}
