Cod sursa(job #1126834)
Utilizator | Data | 27 februarie 2014 09:56:56 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,a,b,i,j,x;
int max1;
sum[6000000];
int main()
{ f>>n;
for(i=1;i<=n;i++) {f>>x;sum[i]=sum[i-1]+x;}
for(i=1;i<=n;i++)
for(j=1;j<i;j++) if(sum[i]-sum[j]>max1) {max1=sum[i]-sum[j];a=j+1;b=i;}
g<<max1<<' '<<a<<" "<<b>>'\n';
f.close();
g.close();
return 0;
}