Cod sursa(job #2033445)
| Utilizator | Data | 6 octombrie 2017 20:05:22 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{int n,a[100],i,j,x,y,s,s2=a[1];
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
g<<a[i]<<" ";
for(i=1;i<n;i++){
s=a[i];
for(j=i+1;j<=n;j++){
s=s+a[j];
if(s>s2){ s2=s; x=i; y=j; }
}
}
g<<endl;
g<<s2<<" "<<x<<" "<<y;
return 0;
}
