Archives
Trending
Support
Login
clear text
XML
Django
JavaScript
MATLAB
C
C++
C#
Python
SQL
Shell
Bash
Markdown
YAML
JSON
HTML
CSS
PHP
Java
Ruby
Go
Rust
Swift
Kotlin
Arduino
TypeScript
Perl
Autohotkey
Lua
SQF
R
Scala
Haskell
Groovy
Dart
Clojure
VB.NET
Objective-C
PowerShell
Bash
CoffeeScript
Verilog
#include <iostream> #include <cstring> #include <vector> #include <queue> #include <algorithm> #include <map> using namespace std; const int maxn = 1005; int main() { ios_base::sync_with_stdio(false); int n; cin >> n; vector<int> v(n); for(int i = 0; i < n; i++) { cin >> v[i]; } map<int, int> m; int i = 0,j = 0; int sum= 0, result = 0; while(j < n and i < n) { if(m[v[j]] < 1) { sum += v[j]; m[v[j]]++; j++; } else { m[v[i]]--; sum -= v[i]; i++; } result =max(result, sum); } return 0; }
Mark as private (unlisted)
for 30 minutes
for 6 hours
for 1 day
for 1 week
for 1 month
for 1 year
everlasting (like CCCP)
