Cod sursa(job #735150)
| Utilizator | Data | 15 aprilie 2012 19:46:23 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
int main(){
int x,n,i,bst,sol,p1,p,u;
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d %d",&n,&sol);
bst=sol; p=u=p1=1;
for(int i=2;i<=n;i++){
scanf("%d",&x);
if(x>bst+x){p1=i;bst=x;} else bst+=x;
if(bst>sol){
sol=bst; p=p1; u=i; } }
printf("%d %d %d\n",sol,p,u);
}
