Cod sursa(job #2756278)
| Utilizator | Data | 30 mai 2021 16:42:17 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int nmax=6000000;
int s[nmax+1];
int main(){
int n;
fin>>n;
fin>>s[1];
int mini=1,maxi=1,sol=s[1],p=1;
for(int i=2;i<=n;i++){
fin>>s[i];
s[i]+=s[i-1];
if(s[i-1]<s[p-1]){
p=i;
}
if(sol<s[i]-s[p-1]){
sol=s[i]-s[p-1];
mini=p;
maxi=i;
}
}
fout<<sol<<" "<<mini<<" "<<maxi<<"\n";
return 0;
}
