Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)
摘要:
A: 思路:就是找b,c之前有多个s[i] 代码: #include<stdio.h>#define ll long longusing namespace std;ll a,b,c;int n;int s[110000];int main(){ while(~scanf("%lld%lld%lld 阅读全文