Cod sursa(job #280173)
| Utilizator | Data | 13 martie 2009 11:27:58 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include<fstream>
using namespace std;
#define INF 0x3F3F3F3F
int main(){
int bestSum, n, i, x, besta=-1, bestc, idc, ids, ide, idea, k;
ifstream f("secv2.in");
bestSum=-INF;
f>>n>>k;
for(i=1;i<=n;i++){
f>>x;
bestc=x; ide=i;
if(besta>=0) bestc=x+besta, ide=idea;
if(bestSum<bestc&&(i-ide+1)>=k) bestSum=bestc, ids=i, idc=ide;
besta=bestc;idea=ide;
}
ofstream g("secv2.out");
g<<bestSum<<' '<<idc<<' '<<ids<<'\n';
f.close();
g.close();
return 0;
}
