Submission #2521582


Source Code Expand

#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#include<cmath>
#include<algorithm>
#include<bitset>
#include<map>
#include<functional>
#include<set>

#pragma region
using namespace std;
#define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++)
#define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--)
#define ALL(x) x.begin(),x.end()
#define RALL(x) x.rbegin(),x.rend()
#define LOWER(a,x) lower_bound(ALL(a), x) - a.begin() - 1;
#define COUNT(a,x)  upper_bound(ALL(a), x) - lower_bound(ALL(a), x);
#define MCOUNT(a,x,y) upper_bound(ALL(a), y) - lower_bound(ALL(a), x);
#define SCAN(x) scanf("%lld",&x);
#define INF INT64_MAX
#define MOD 1000000007
#define pb push_back
#define F first
#define S second
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef map<ll, ll> MAP;
typedef set<ll> SET;
ll n = 0, m = 0, ans = 0, sum = 0, cnt = 0, tmp = 0, ma = 0, mi = 0;
string s;
bool flag, ok;
ll dx[4] = { 1,-1,0,0 }, dy[4] = { 0,0,1,-1 };
ll ddx[9] = { 1,-1,0,0,1,1,-1,-1,0 }, ddy[9] = { 0,0,1,-1,1,-1,1,-1,0 };
#pragma endregion
#define MAX 111111



int main(void) {
  cin >> n;
  vll a;
  FOR(i, 0, n) {
	cin >> tmp;
	a.pb(tmp);
  }

  tmp = -INF;
  FOR(i, 0, n) {
	if (a[i] > tmp) {
	  cnt++;
	}
	else {
	  cnt = 1;
	}
	tmp = a[i];
	ans += cnt;
  }
  cout << ans << endl;

  return 0;
}

Submission Info

Submission Time
Task C - 単調増加
User hide1214
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1434 Byte
Status AC
Exec Time 29 ms
Memory 1400 KB

Judge Result

Set Name Sample Subtask0 All
Score / Max Score 0 / 0 40 / 40 60 / 60
Status
AC × 4
AC × 19
AC × 35
Set Name Test Cases
Sample sample0.txt, sample1.txt, sample2.txt, sample3.txt
Subtask0 sample0.txt, sample1.txt, sample2.txt, sample3.txt, subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt
All sample0.txt, sample1.txt, sample2.txt, sample3.txt, subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt
Case Name Status Exec Time Memory
sample0.txt AC 1 ms 256 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB
sample3.txt AC 1 ms 256 KB
subtask0_0.txt AC 2 ms 256 KB
subtask0_1.txt AC 2 ms 256 KB
subtask0_10.txt AC 2 ms 256 KB
subtask0_11.txt AC 2 ms 256 KB
subtask0_12.txt AC 2 ms 256 KB
subtask0_13.txt AC 2 ms 256 KB
subtask0_14.txt AC 2 ms 256 KB
subtask0_2.txt AC 1 ms 256 KB
subtask0_3.txt AC 1 ms 256 KB
subtask0_4.txt AC 2 ms 256 KB
subtask0_5.txt AC 1 ms 256 KB
subtask0_6.txt AC 1 ms 256 KB
subtask0_7.txt AC 1 ms 256 KB
subtask0_8.txt AC 1 ms 256 KB
subtask0_9.txt AC 2 ms 256 KB
subtask1_0.txt AC 25 ms 1400 KB
subtask1_1.txt AC 11 ms 892 KB
subtask1_10.txt AC 29 ms 1400 KB
subtask1_11.txt AC 29 ms 1400 KB
subtask1_12.txt AC 29 ms 1400 KB
subtask1_13.txt AC 29 ms 1400 KB
subtask1_14.txt AC 29 ms 1400 KB
subtask1_15.txt AC 29 ms 1400 KB
subtask1_2.txt AC 9 ms 640 KB
subtask1_3.txt AC 20 ms 892 KB
subtask1_4.txt AC 23 ms 1400 KB
subtask1_5.txt AC 21 ms 1400 KB
subtask1_6.txt AC 13 ms 892 KB
subtask1_7.txt AC 27 ms 1400 KB
subtask1_8.txt AC 8 ms 640 KB
subtask1_9.txt AC 4 ms 512 KB