Mai intai trebuie sa te autentifici.
Cod sursa(job #863786)
| Utilizator | Data | 24 ianuarie 2013 06:12:24 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <stdio.h>
#include <math.h>
#include <algorithm>
using namespace std;
FILE *f=fopen("smax.in","r");
FILE *g=fopen("smax.out","w");
int i,n,smax,pi,ps,v[100],st[100];
int max(int a,int b)
{
if(a>b) return a;
else return b;
}
int main()
{
fscanf(f,"%d",&n);
for(i=1;i<=n;i++)
fscanf(f,"%d",&v[i]);
for(i=1;i<=n;i++)
{
st[i]=max(st[i-1]+v[i],v[i]);
if(st[i]==v[i]) pi=i;
if(st[i]>smax)
{
smax=st[i];
ps=i;
}
}
fprintf(g,"%d\n%d %d",smax,pi,ps);
fclose(g);
return 0;
}
