codeforces 686A A. Free Ice Cream(水题)
Posted LittlePointer
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了codeforces 686A A. Free Ice Cream(水题)相关的知识,希望对你有一定的参考价值。
题目链接:
//#include <bits/stdc++.h> #include <vector> #include <iostream> #include <queue> #include <cmath> #include <map> #include <cstring> #include <algorithm> #include <cstdio> using namespace std; #define Riep(n) for(int i=1;i<=n;i++) #define Riop(n) for(int i=0;i<n;i++) #define Rjep(n) for(int j=1;j<=n;j++) #define Rjop(n) for(int j=0;j<n;j++) #define mst(ss,b) memset(ss,b,sizeof(ss)); typedef long long LL; template<class T> void read(T&num) { char CH; bool F=false; for(CH=getchar();CH<‘0‘||CH>‘9‘;F= CH==‘-‘,CH=getchar()); for(num=0;CH>=‘0‘&&CH<=‘9‘;num=num*10+CH-‘0‘,CH=getchar()); F && (num=-num); } int stk[70], tp; template<class T> inline void print(T p) { if(!p) { puts("0"); return; } while(p) stk[++ tp] = p%10, p/=10; while(tp) putchar(stk[tp--] + ‘0‘); putchar(‘\n‘); } const LL mod=1e9+7; const double PI=acos(-1.0); const LL inf=1e18; const int N=(1<<18)+10; const int maxn=1005; int n,x; int main() { read(n);read(x); LL sum=x,num=0; while(n--) { char m; LL a; cin>>m>>a; if(m==‘-‘) { if(sum>=a)sum-=a; else num++; } else sum+=a; } cout<<sum<<" "<<num<<"\n"; return 0; }
以上是关于codeforces 686A A. Free Ice Cream(水题)的主要内容,如果未能解决你的问题,请参考以下文章
Codeforces Round #260 (Div. 1) A. Boredom (简单dp)
Codeforces1161 A. Hide and Seek(思维)
Codeforces Beta Round #1 A. Theatre Square